On 17 Aug 2012, at 17:23, Roger wrote:
Wouldn't Godel incompleteness be the fatal flaw in at least some
Turing machines ?
It is a "fatal flaw" in the sense that it prevents all Turing machine,
including all universal machines, to be omniscient, even just about
arithmetic and machines.
On Aug 17, 2012, at 10:23 AM, "Roger " wrote:
Hi Jason Resch
Wouldn't Godel incompleteness be the fatal flaw in at least some
Turing machines ?
A flaw in what sense?
Meaning, they cannot have a full set of instructions or data.
It doesn't matter how many instructions a particular a
Hi Jason Resch
Wouldn't Godel incompleteness be the fatal flaw in at least some Turing
machines ?
Meaning, they cannot have a full set of instructions or data.
Roger , rclo...@verizon.net
8/17/2012
Leibniz would say, "If there's no God, we'd have to invent him so everything
could function.
3 matches
Mail list logo
