Finite algorithmic procedures and inductive definability. (English) Zbl 0448.03037
MSC:
03D70 | Inductive definability |
03D75 | Abstract and axiomatic computability and recursion theory |
68W99 | Algorithms in computer science |
03D60 | Computability and recursion theory on ordinals, admissible sets, etc. |
03D15 | Complexity of computation (including implicit computational complexity) |
03D10 | Turing machines and related notions |