On Thu, Jan 24, 2008 at 04:48:28PM -0800, Darren New wrote:
David Brown wrote:
I can definitively declare that this is unsolvable, just because of
magnitude. In fact solving the halting problem this way only works for
trivially small computer system (a handfull of bits).
Not at all. Solve it on a Turing machine. That's kind of the point I'm
making. Before you say "the brain can (or cannot) solve the halting
problem," you have to understand what the halting problem is and what makes
it unsolvable.
All I'm saying is that the halting problem states that problems on an
unbounded machine isn't solvable, but even on a severely bounded machine,
there is no practical solution.
David
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
