Algorithmic Procedures
From MaRDI portal
Recommendations
Cites work
- A Complete Axiomatization of Computer Arithmetic
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3053259 (Why is no real title available?)
- Model theory.
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The Irrationals are not Recursively Enumerable
Cited in
(15)- On approximate and algebraic computability over the real numbers
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
- scientific article; zbMATH DE number 3880674 (Why is no real title available?)
- The Irrationals are not Recursively Enumerable
- Computation over algebraic structures and a classification of undecidable problems
- Theses for computation and recursion on concrete and abstract structures
- scientific article; zbMATH DE number 1827830 (Why is no real title available?)
- scientific article; zbMATH DE number 1390022 (Why is no real title available?)
- scientific article; zbMATH DE number 7434637 (Why is no real title available?)
- NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES
- scientific article; zbMATH DE number 3893185 (Why is no real title available?)
- A difference in complexity between recursion and tail recursion
- Feferman on computability
- Computability over arbitrary fields
This page was built for publication: Algorithmic Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018437)
