Gregory's ServerJohn McCarthy wrote:
> In the 1950s I thought that the smallest possible (symbol-state
> product) universal Turing machine would tell something about the
> nature of computation. Unfortunately, it didn't.
 2 comments
@AlgoCompSynth I read it not too long ago, and I don't remember reading that it was, it beats around similar bushes, but it's not really addressing that. In Chatin's latest book, a bit. |
@neauoire Hmmm ... "Are typical systems that we encounter in nature universal? Or are they
computationally much simpler?"
It's been a long time since I read it, but isn't this addressed in _Gödel, Escher, Bach__?