Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6284211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation |
scientific article; zbMATH DE number 6284211 |
Statements
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (English)
0 references
14 April 2014
0 references
theory of computation
0 references
Davis-Putnam-Robinson-Matiyasevich theorem
0 references
Diophantine equation with a finite number of solutions
0 references
Matiyasevich's conjecture on finite-fold
0 references
Diophantine representations
0 references
0.8325043320655823
0 references
0.8210147619247437
0 references
0.7927892804145813
0 references
0.7914036512374878
0 references
0.7751557230949402
0 references
