Talk:Strelnokoff

Alternative Turing-completeness proof approach

I think it's possible to work around the probabilistic execution order by writing the entire program as a single statement. Something like Tip (without I/O, or at least with output working differently) seems fairly easy to implement as a single statement; for example, you can use an expression of the form ((((X + 5) / 10) - ((X + 4) / 10)) * (…)) to produce a value only when X mod 5 is 10 (producing 0 otherwise), then add together the results of expressions that act differently with different values of X mod 10 to produce the new value of X. --ais523 16:46, 31 January 2024 (UTC)