3 ms·
One counterexample for you: Conway's game of life has finite number of rules but you can construct universal turing machine with it that will have formally unde
by gaika 18y ago
One counterexample for you: Conway's game of life has finite number of rules but you can construct universal turing machine with it that will have formally undecidable behaviour.