X-Message-Number: 8611
Date: Wed, 17 Sep 1997 23:25:18 -0700
From: Hara Ra <>
Subject: Turing Machines vs Brains

Thomas Donaldson <>:

>I am certainly aware of all the ideas for mapping, say, a digital N-dim
>infinite set of points to a single 1-dim sequence of points. Perhaps
>that solves the problem of equivalence and perhaps not: remember that
>such a mapping would have to change constantly as the Turing machine
>proceeded.

If you have N neurons, you can simulate ANY possible topology of
connections in a N x N matrix of weights. Of course with N of the order
10^13, we get a tape with some 10^26 values on it. The Turing machine
needen't be too complex here, just read the values for each neuron and
execute the neuron's response and learning functions. Very, very slow of
course......
 
O----------------------------------O
|  Hara Ra <>  |
|  Box 8334  Santa Cruz, CA 95061  |
O----------------------------------O

Rate This Message: http://www.cryonet.org/cgi-bin/rate.cgi?msg=8611