Algorithmic Procedures

DOI10.2307/2154033zbMath0774.03030OpenAlexW4245555137MaRDI QIDQ4018437

Richard Mansfield, Harvey M. Friedman

Publication date: 16 January 1993

Full work available at URL: https://doi.org/10.2307/2154033

zbMATH Keywords

definabilitycomputable functionscomputabilityabstract recursion theorypairing functionscomputations on rings and fieldsprogram language

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Related Items (8)

P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) ⋮ Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) ⋮ Computation over algebraic structures and a classification of undecidable problems ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ A difference in complexity between recursion and tail recursion ⋮ The Irrationals are not Recursively Enumerable ⋮ Feferman on Computability ⋮ On approximate and algebraic computability over the real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Model theory.
• The Irrationals are not Recursively Enumerable
• A Complete Axiomatization of Computer Arithmetic
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Algorithmic Procedures