Finite alogorithmic procedures and inductive definability.

DOI10.7146/MATH.SCAND.A-11852zbMath0448.03037OpenAlexW2535695058MaRDI QIDQ3893918

Viggo Stoltenberg-Hansen, J. V. Tucker, Johan Moldestad

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

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

Related Items (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.