From Esolang
Jump to: navigation, search

Turing completeness

The example shown does not prove turing completeness. The description provided seems rather vague, so I can't really tell, but the memory seems to be infinite and all entirely accessible, so I think that it probably is turing complete. It should be simple enough to simuate a UTM in this language to actually prove its turing completeness.4D enthusiast (talk) 17:28, 24 October 2012 (UTC)