scientific article

zbMath0664.03030MaRDI QIDQ3815289

A. I. Mal'tsev

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reducibilityTuring machinesHilbert's 10th problemDiophantine equationsarithmetic functionsprimitive recursive functionspartial recursive functionsChurch's theorem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Undecidability and degrees of sets of sentences (03D35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Recursive functions and relations, subrecursive hierarchies (03D20) Word problems, etc. in computability and recursion theory (03D40) Recursively (computably) enumerable sets and degrees (03D25) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45) Algorithms in computer science (68W99) Thue and Post systems, etc. (03D03) Diophantine equations (11D99) Computability and recursion theory (03Dxx)

Related Items

Algorithmic problems for differential polynomial algebras ⋮ On some generalizations of the primitive recursive arithmetic ⋮ Small universal Turing machines ⋮ Computably separable models ⋮ Dynamical conflict models. I. Language of modeling ⋮ On polynomial-modular recursive sequences ⋮ On the enumeration closure operator in multivalued logic ⋮ On proofs of properties of semirecursive sets ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Modeling multitape Minsky and Turing machines by three-tape Minsky machines ⋮ Completeness criterion for the enumeration closure operator in three-valued logic

This page was built for publication: