> Only an infinite number of subclasses of instances to go.
There's only one subclass of instances for which the problem is undecidable: those where the program being analyzed is allowed to consume infinite memory.
Which is not the same thing as saying that the program is implemented in a Turing-complete language.
Because you can write a program in a Turing-complete language and yet, run it on a machine with finite memory (i.e. a computer).
There's only one subclass of instances for which the problem is undecidable: those where the program being analyzed is allowed to consume infinite memory.
Which is not the same thing as saying that the program is implemented in a Turing-complete language.
Because you can write a program in a Turing-complete language and yet, run it on a machine with finite memory (i.e. a computer).