Finite alogorithmic procedures and computation theories.
From MaRDI portal
Publication:3853126
DOI10.7146/math.scand.a-11853zbMath0419.68078OpenAlexW2262736450MaRDI QIDQ3853126
J. V. Tucker, Johan Moldestad, Viggo Stoltenberg-Hansen
Publication date: 1980
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/166691
partial recursive functionsregister machinesrelational systemfinite algorithmic procedurescomputation theoriesrecursion-theoretic properties of computable functions
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Computability by nondeterministic program and the Moschovakis search computability ⋮ Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Generalizing Computability Theory to Abstract Algebras ⋮ A difference in complexity between recursion and tail recursion ⋮ Feferman on Computability
This page was built for publication: Finite alogorithmic procedures and computation theories.
