Classical computability and indicators of nondeterminism

MaRDI QIDQ3535105zbMATH OpenFDO

Authors A. M. Anisov

Publication date 10 November 2008

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Nonstandard models in mathematics (03H05)

Recommendations

• Nondeterministic computability: philosophical foundations
• The physical Church-Turing thesis and non-deterministic computation over the real numbers
• From nonstandard analysis to various flavours of computability theory
• On non-classical theory of computability
• scientific article; zbMATH DE number 3979058

Cited in

(4)

• Strong determinism vs. computability
• Nondeterministic computability: philosophical foundations
• Non-deterministic computation and the Jayne-Rogers theorem
• Destinies and decidability

This page was built for publication: Classical computability and indicators of nondeterminism

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