From: Robin Lee Powell (firstname.lastname@example.org)
Date: Fri Oct 08 2004 - 12:55:07 MDT
On Fri, Oct 08, 2004 at 08:27:47PM +0200, Christian Szegedy wrote:
> His argument is based on a proof by contradiction. It goes by:
> 1) Assume that your brain can be modeled by a Turing machine
> (This is true even if it is a finite state machine)
Sorry, you can't make that leap. FSMs are strictly less powerful
than Turing machines, and if our brains can be modelled by TMs, they
can be modelled by FSMs (since they are finite). To have any
convincing power at all, you must show that the problem applies to
the least powerful thing that can be used to simulate our brains.
-- http://www.digitalkingdom.org/~rlpowell/ *** http://www.lojban.org/ Reason #237 To Learn Lojban: "Homonyms: Their Grate!"
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:49 MDT