Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
scientific article

    Statements

    Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (English)
    0 references
    0 references
    14 April 2014
    0 references
    0 references
    0 references
    0 references
    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 references