Comment Re:I doubt it (Score 1) 464
Any thoughts on the thickness of the shells of mussels in response to the presence of crabs?
Any thoughts on the thickness of the shells of mussels in response to the presence of crabs?
I agree with your summary of the BSD license. However, the GPL doesn't say that you're not making money off your code, or that you can't make money off it. It says (amongst other things) that you can distribute the software, and that you must provide the source code if you do distribute it.
Nevermind, it seems to be back now, along with a whole load of other things.
This is a test.
Slashdot editors, what happened to the version of this story I just submitted at the same time with the same title, that's now mysteriously disappeared?
I still have a link to it in my submissions bar, but it's nowhere else to be seen:
http://slashdot.org/firehose.pl?op=view&id=19224228
(I add that my summary made more sense than this one).
And your statements about reliability? In what sense can a logic circuit be "guaranteed" free of defects? Did Intel know about this method of quality assurance back when they were designing the Pentium? It seems to me that simple logic circuits can be guaranteed free of defects because the human mind can readily model the whole system and intuitively decide it is correct. When the system is complex, that is no longer true.
There is some progress being made towards "guaranteeing" the correctness of circuits, such as:
this. Centaur Technologies (VIA) uses theorem proving tools to guarantee the correctness of parts of the VIA Nano processor. I'm sure with a little digging more references to this sort of thing can be found.
Intel appears to be actively working in the area of formal verification also, e.g. this - although this doesn't directly deal with low level circuits.
So, it is possible to guarantee some correctness, although I suspect it rests on the correctness of the theorem prover you're using also.
Probably not for as long as Windows...
It's true that I didn't even get an idea of why it is true because of Godel Incompleteness. Can you explain a little more please?
So, there is no such thing as a standard that exactly describes in every way every scenario and how to handle it because any theory capable of expressing arithmetic cannot be both consistent and complete? Or, because any recursively enumerable theory which includes basic arithmetic truths and certain truths about provability includes a statement about its own consistency if and only if it is inconsistent?
Excuse me for being thick, but could someone explain this joke?
13. ... r-q1