|
|
|
|
|
|
by nil-sec
2208 days ago
|
|
|
Turing completeness isn’t necessarily an interesting thing to have in common. Many (very simple) models of computation are Turing complete but have vastly different properties. Take for example a cellular automata, a Turing machine, Wang tiles, (cyclic) Tag systems, Fractrans, Register machines, string rewriting systems. All of these are Turing complete. Yet they are miles apart in how they carry out computation. In order to understand and do what the brain is doing we have to figure out the brains model of computation. It will also be Turing complete but it will look very different than a Turing machine. |
|
|