Episode 13: Objections to Artificial General Intelligence
The Theory of Anything
00:00
The Universality of Computing
Turing machine is just like something called finite automata equipped with a tape. If you throw away this memory, memory out the long tape, then you just only have finite automata. So and this thing, although it is not a machine that is not universal for all computation anymore, but it is still universal with respect to some small set actually. And that is something that you are familiar with, which is a regular expression.
Transcript
Play full episode
