All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computa
DOI10.1007/978-3-319-18275-9_24zbMath1349.03041arXiv1309.2682OpenAlexW3103944247MaRDI QIDQ2790449
Publication date: 4 March 2016
Published in: Computation, Cryptography, and Network Security (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2682
Davis-Putnam-Robinson-Matiyasevich theoremDiophantine equation with a unique integer solutionDiophantine equation with a unique solution in non-negative integerslimit-computable functionsingle-fold Diophantine representationtrial-and-error computable function
Decidability (number-theoretic aspects) (11U05) Recursive functions and relations, subrecursive hierarchies (03D20)
Uses Software
Cites Work
- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
- Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set?
- On the Computational Complexity of Determining the Solvability or Unsolvability of the Equation X 2 - DY 2 = -1
- The Little Book of Bigger Primes
This page was built for publication: All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computa
