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

constructivenessregister machinesfinite algorithmic procedurescomputable functions over a relational structuretheory of computing in algebraic systems

Mathematics Subject Classification ID

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

Cited in

(2)

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

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)