jksk61·2 年前·議論now the question is: what is the most complex* object that it is not turing complete?* let's say you have n distinct rules acting against a set S, the complexity is n.p.s. probably something trivial exists such that you can take n as large as we wish to, so probably my definitions are not interesting.
* let's say you have n distinct rules acting against a set S, the complexity is n.
p.s. probably something trivial exists such that you can take n as large as we wish to, so probably my definitions are not interesting.