Can a programming language without arrays be turing-complete?
- by Ring
My question is simple:
There are no arrays possible. That means you can address variables only "statically" by directly using their unique name. (This already throws out the default array syntax variable[ index ] and variable variables)
"Emulated arrays" are counted as arrays and excluded too. Examples: You could basically simulate arrays using strings (quite easily actually) or use variable variables as in PHP.
Can such a language be turing-complete?
Brainf*ck for example has arrays, in fact it is one big array, isn't it?
