Abstract recursion and intrinsic complexity

DOI10.1017/9781108234238MaRDI QIDQ4690192zbMATH OpenOpenAlexFDO

Authors Yiannis N. Moschovakis

Publication date 22 October 2018

Full work available at URL https://doi.org/10.1017/9781108234238

zbMATH Keywords

abstract recursionalgorithmcomplexityhomomorphism methodMcCarthy programrecursive programuniform process

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 3952713
• scientific article; zbMATH DE number 4004169
• Bounded queries in recursion theory
• scientific article; zbMATH DE number 738396
• scientific article; zbMATH DE number 578252

Cited in

(8)

• Bounded queries in recursion theory
• Abstract recursive utility
• scientific article; zbMATH DE number 5295822 (Why is no real title available?)
• Tailoring recursion for complexity
• A behavioural theory of recursive algorithms
• scientific article; zbMATH DE number 7453191 (Why is no real title available?)
• Verification, Model Checking, and Abstract Interpretation
• A logical characterization of weak determinism as simultaneous application

This page was built for publication: Abstract recursion and intrinsic complexity

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