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 Computability is an Open Problem (Q2790449): Difference between revisions
From MaRDI portal
Latest revision as of 12:44, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 Computability is an Open Problem |
scientific article |
Statements
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 Computability is an Open Problem (English)
0 references
4 March 2016
0 references
Davis-Putnam-Robinson-Matiyasevich theorem
0 references
Diophantine equation with a unique integer solution
0 references
Diophantine equation with a unique solution in non-negative integers
0 references
limit-computable function
0 references
single-fold Diophantine representation
0 references
trial-and-error computable function
0 references
0 references
0 references
