3 ms·
A demonstration of Turing equivalency. Any Turing complete computer can do what any other Turing complete computer can do if you don’t care about time.
by wang_li 3y ago
A demonstration of Turing equivalency. Any Turing complete computer can do what any other Turing complete computer can do if you don’t care about time.
- rhplus 3y agoTime and memory.
- jhallenworld 3y agoYeah, so technically a Turing machine has infinite memory.. so no real-world computer is fully Turing complete.
- vidarh 3y agoA Turing machine has infinite tape. Which can be implemented in terms of RAM but can just as well be implemented in terms of sequentially addressable IO, and pretty much every real-world computer has that, so it's a meaningless technicality as while there are practical limits on our ability to feed it more input, those are not conceptual limits of the machine.
- jwilk 3y agoHow do you run Linux in lambda calculus?
- krylon 3y agoSlowly. Very slowly.