Algebraic computability and enumeration models. Recursion theory and descriptive complexity

DOI10.1201/B21197MaRDI QIDQ2949142zbMATH OpenOpenAlexFDO

Authors Cyrus F. Nourani

Publication date 7 October 2015

Full work available at URL https://doi.org/10.1201/b21197

zbMATH Keywords

Kolmogorov complexityadmissibilitycomputabilityarithmetical hierarchyTuring degreese-degrees

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Higher-type and set recursion theory (03D65)

Recommendations

• scientific article; zbMATH DE number 530148
• Turing computability. Theory and applications
• scientific article; zbMATH DE number 1955470
• A Functorial Model Theory
• Computability

Cited in

(3)

• scientific article; zbMATH DE number 5825969 (Why is no real title available?)
• Hypercomputation by definition
• Computable Models

This page was built for publication: Algebraic computability and enumeration models. Recursion theory and descriptive complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949142)