×
Moldestad, J.; Stoltenberg-Hansen, V.; Tucker, J. V.

Finite algorithmic procedures and inductive definability. (English) Zbl 0448.03037

Math. Scand. 46, 62-76 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0448.03037

Cited in 2 Documents

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

Keywords:

finite algorithmic procedures; computable functions over a relational structure; theory of computing in algebraic systems; constructiveness; register machines

Citations:

Zbl 0419.68078; Zbl 0431.68042; Zbl 0221.02018
Cite Review PDF
Full Text: DOI EuDML