Talk:Deviating Percolator

Turing-completeness

I think it may be possible to show Deviating Percolator Turing-complete. Because no limit seems to have been placed on the size of the values stored, it could be a Minsky machine. —Maharba 22:10, 21 July 2011 (UTC)

Um it pretty clearly limits expressions to having results in 0-255. --Ørjan 00:12, 22 July 2011 (UTC)

You're right; I didn't notice that. I wonder if it would be TC without that restriction, though. —Maharba 00:50, 22 July 2011 (UTC)

Yeah probably. --Ørjan 05:07, 22 July 2011 (UTC)

Preprocessor perhaps?

Just a thought -- With a Macro Preprocessor, I'm pretty sure you could circumvent the redefinition confusion which seems so easy in the language. --(this comment by Moopli at 02:13, 3 August 2012‎ UTC; please sign your comments with ~~~~)

"Compliant Interpreters"

I'm pretty sure a language's interpreter's compliance has nothing to do with how it works internally; just that it produces the expected result for all programs.