scientific article; zbMATH DE number 3922632
unsolvabilityrecursive functionscreativityComplexityChurch's ThesisNondeterminismrecursion theoremsMachinesReducibilityproductivenessGödel's incompleteness theoremArithmetizationEffective enumerabilityRecursivenessRelativized computability
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Turing machines and related notions (03D10) Other degrees and reducibilities in computability and recursion theory (03D30) Undecidability and degrees of sets of sentences (03D35) Computability and recursion theory (03Dxx)
- scientific article; zbMATH DE number 1285742 (Why is no real title available?)
- Maschinen, Intelligenz und Selbstbezüglichkeit - Gedanken zu einem Bestseller
- A mechanisation of computability theory in HOL
- scientific article; zbMATH DE number 5354044 (Why is no real title available?)
- EAGLE start-up aid. Theory of computability. Cantor diagonalization, Gödelization, Turing machines
- scientific article; zbMATH DE number 4088936 (Why is no real title available?)
- Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems
- The concept of computability
- Bounded linear logic: A modular approach to polynomial-time computability
- Termination of rewriting
- A formalization of polytime functions
- Weights for total division orderings on strings
- scientific article; zbMATH DE number 3165537 (Why is no real title available?)
- The influence of domain interpretations on computational models
- McNaughton families of languages.
- Computability
- scientific article; zbMATH DE number 1880324 (Why is no real title available?)
- Computability and human symbolic output
- An inductive number-theoretic characterization of NP
- Encoding the factorisation calculus
- Computability in Specification
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698786)
