thoughts on Turing-completeness

Cool, a Piet forum. Now to fill it with people.

One thought I had was of writing a Brainf*** interpreter in Piet. This would provide concrete proof of Turing-completeness. A series of 30000 values could be at the bottom of the stack as the interpreted program's data, followed by the interpreted program itself, and then a working area for the current operation.

Why that language, you might ask. For one, it's Turing-complete. Secondly, it's an easy language to interpret. It's also one of the most popular esoteric language, perhaps because of its name.

Good idea, but how would you get programs from brainf*** into it?


PS:2 members in the forum! whoo!

Yeah, I had forgot that detail from when I was originally doing it. What I had thought of would be a piet routine that reads in from stdin until it reaches a ctrl-d, aka end-of-file, skipping invalid characters. Then it would execute the program.

PS: hehehe the membership has doubled!