3 ms·
It doesn't seem terribly crackpotish to me. He's absolutely correct in pointing out that it's very sloppy to define "computability" as "What the Universal Turin
by KirinDave 18y ago
It doesn't seem terribly crackpotish to me. He's absolutely correct in pointing out that it's very sloppy to define "computability" as "What the Universal Turing Machine Can Do." It's also not unreasonable at all to talk about variables that change with time, and he's absolutely correct that this is a gap in complexity theory. One which should excite new grad students, because eventually it will net someone a lot of academic fame and one hell of a PhD thesis.
Personally, I'm very interested in this and I'm going to keep an eye on it.
- dhs 18y agoIt is quite unreasonable to talk about variables that change with time in the context of a Turing machine. If a "Universal Computer" is one that deals with variables which change during the computation due to interaction, then it is not what Turing was talking about. And if he wasn't talking about it, he can't be wrong about it.
- sep332 18y agoThe argument isn't about computing, it's about naming. The argument here is whether a Turing machine is really "universal".
- dhs 18y agoIt's naming, plus some more: Turing never named his idealized entity a "Turing machine" - that was done by others. He claimed universality for the algorithmic "Universal Computing Machine" he defined, and proved it - for algorithms. Now Akl comes along and says the "Turing machine" is not universal, but he uses interaction, not algorithm, to base his definition of computation on. So it seems to me that he's not only renaming "the Universal Computing Machine" to "the Universal Computer" by ways of "the Turing Machine", but that he is also moving the goalposts in this process.