Computability theory

MaRDI QIDQ2851819zbMATH OpenFDO

Authors S. Barry Cooper

Publication date 4 October 2013

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10)

Recommendations

• scientific article; zbMATH DE number 1955470
• Directions for computability theory beyond pure mathematical
• Turing computability. Theory and applications
• Alan Turing and the foundations of computable analysis
• The concept of computability

Cited in

(21)

• The Turing universe in the context of enumeration reducibility
• scientific article; zbMATH DE number 1285742 (Why is no real title available?)
• The Extended Turing Model as Contextual Tool
• Incomputability emergent, and higher type computation
• The incomputable
• scientific article; zbMATH DE number 1061261 (Why is no real title available?)
• Computability issues for adaptive logics in multi-consequence standard format
• Computation as social agency: what, how and who
• Theoretical computer science: computability, decidability and logic
• Swarm Intelligence
• A survey on universal computably enumerable equivalence relations
• Turing computability: structural theory
• A roadmap for TAMC
• Theory of computation.
• Directions for computability theory beyond pure mathematical
• scientific article; zbMATH DE number 6164359 (Why is no real title available?)
• Computability and complexity theory
• Toward a generalized computability theory
• The Foundations of Computability Theory
• Philosophy of Computation
• The Foundations of Computability Theory

This page was built for publication: Computability theory

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