Nondeterministic computability: philosophical foundations

MaRDI QIDQ3567758zbMATH OpenFDO

Authors A. M. Anisov

Publication date 17 June 2010

zbMATH Keywords

computational modelling of causal relationshipsnondeterministic computability

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Turing machines and related notions (03D10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Classical computability and indicators of nondeterminism
• Nondeterminism and nondeterministic degree
• scientific article; zbMATH DE number 2084366
• The physical Church-Turing thesis and non-deterministic computation over the real numbers
• scientific article; zbMATH DE number 1993590

Cited in

(4)

• Strong determinism vs. computability
• Nondeterminism and nondeterministic degree
• Classical computability and indicators of nondeterminism
• scientific article; zbMATH DE number 1993590 (Why is no real title available?)

This page was built for publication: Nondeterministic computability: philosophical foundations

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