|Problems? Is your data what you think it is?|
Re^2: Are Perl patterns universal?by sleepingsquirrel (Hermit)
|on Nov 09, 2004 at 17:30 UTC||Need Help??|
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.
-- All code is 100% tested and functional unless otherwise noted.