Finite alogorithmic procedures and inductive definability.

DOI10.7146/MATH.SCAND.A-11852MaRDI QIDQ3893918zbMATH OpenOpenAlexFDO

Authors Johan Moldestad, Viggo Stoltenberg-Hansen, John V. Tucker

Publication date 1980

Published in MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/166690

zbMATH Keywords

computable functions over a relational structureconstructivenessfinite algorithmic proceduresregister machinestheory of computing in algebraic systems

Mathematics Subject Classification ID

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

Cited in

(2)

• Theses for computation and recursion on concrete and abstract structures
• Feferman on computability

This page was built for publication: Finite alogorithmic procedures and inductive definability.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893918)