scientific article
zbMath0471.03003MaRDI QIDQ3924153
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computabilityrandomnessGödel's theoremdiophantine setsrecursive groupscomplexity estimates for computations and algorithmsexistence of uncomputable functions and algorithmically undecidable problemsMatijasevic's theorem
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) 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) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (26)
This page was built for publication: