Linked by Thom Holwerda on Tue 9th May 2006 21:25 UTC, submitted by luzr
OSNews, Generic OSes Torvalds has indeed chimed in on the micro vs. monolithic kernel debate. Going all 1992, he says: "The whole 'microkernels are simpler' argument is just bull, and it is clearly shown to be bull by the fact that whenever you compare the speed of development of a microkernel and a traditional kernel, the traditional kernel wins. The whole argument that microkernels are somehow 'more secure' or 'more stable' is also total crap. The fact that each individual piece is simple and secure does not make the aggregate either simple or secure. And the argument that you can 'just reload' a failed service and not take the whole system down is equally flawed." My take: While I am not qualified to reply to Linus, there is one thing I want to say: just because it is difficult to program, does not make it the worse design.
Thread beginning with comment 123426
To view parent comment, click here.
To read all comments associated with this story, please click here.
Member since:

You fail to understand the following: there is no "one size fits all" solution to every imaginable engineering problem. Synchronous programming languages are great to solve certain classes of problems, as do functional languages, imperative languages, logic languages, declarative languages, etc.

Actually all languages are equal and they can solve the same problems, and this is already proven. Programming languages differ at the degree of easiness to solve a problem, but signal-based programming goes above all these models, because it is a modelling technique that reflects reality so well that it becomes very easy to solve most, if not all, problems.

All the other programming models are used to emulate signal-based programming. Most programs are a bunch of signals (gui or other type events) and responses. Even functional programs are.

Reply Parent Score: 1

Cloudy Member since:

Actually all languages are equal and they can solve the same problems, and this is already proven.

Turing equivalence is not equality. Syntactic sugar matters, which is why some languages are more suitable to certain problems than others. (Otherwise, we'd simply program Turing machines directly.)

While it is true that computation consists of communication and transformation, it is not true that such is synchronous.

Reply Parent Score: 1