What does it mean if a programming language is `turing complete'?
Name:
Anonymous2007-06-20 5:35 ID:ZZyTsT6W
Bump.
Can someone really explain it to me, enough joking around? From what I understand, something is turing-complete if it is capable of emulating a "universal turing machine", which apparently is a machine which reads instructions (symbols) from an infinitely long strip of tape? These concepts are weird, like, what exactly is it used for? What's the deal with the infinite tape? Argh