scientific article; zbMATH DE number 478433
From MaRDI portal
Publication:4273953
zbMath0789.03039MaRDI QIDQ4273953
Publication date: 8 December 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
word problemrecursive setscomputable functionsundecidable theorieshierarchiesTuring degreesr.e. setsregister machines
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) Computability and recursion theory (03Dxx)
Related Items
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ The dependence of computability on numerical notations ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION
