A Turing machine must have unbounded memory.Yeah. But I'm encouraged because of the possibility of infinite recursion (from above).
In addition, you don't have write access to this memory in any sort of arbitrary fashionIt is not obvious to me how to do arbitrary memory access in any of the following, but they're all universal.
In reply to Re^2: Are Perl patterns universal?
by sleepingsquirrel
in thread Are Perl patterns universal?
by sleepingsquirrel
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |