scientific article; zbMATH DE number 817189

MaRDI QIDQ4854624zbMATH OpenFDO

Authors Costică Cazacu

Publication date 16 April 1996

zbMATH Keywords

RAM-machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The Foundations of Computability Theory
• The Foundations of Computability Theory
• Finitely bounded effective computability
• Effective domains and concrete computability: A survey
• Effective choice and boundedness principles in computable analysis
• Effective Choice and Boundedness Principles in Computable Analysis
• Towards a formal theory of computability
• Relative computability in the effective topos
• Toward a generalized computability theory
• On the uniform computational content of computability theory

Cited in

(5)

• On TAE machines and their computational power
• Effective Choice and Boundedness Principles in Computable Analysis
• Effective Brenier Theorem
• scientific article; zbMATH DE number 7453165 (Why is no real title available?)
• Effective theories for circuits and automata

This page was built for publication:

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