scientific article; zbMATH DE number 5064401

MaRDI QIDQ5493754zbMATH OpenFDO

Authors Jerzy Mycka

Publication date 16 October 2006

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)

Recommendations

• Digital simulation of analog computation and Church's thesis
• An analogue-digital Church-Turing thesis
• Church's thesis and physical computation
• The complexity of analog computation
• The promise of analog computation
• A new conceptual framework for analog computation
• Analog computation beyond the Turing limit
• A Survey on Analog Models of Computation
• The New Promise of Analog Computation
• Church's thesis and the conceptual analysis of computability

Cited in

(7)

• The complexity of analog computation
• Turing machines can be efficiently simulated by the general purpose analog computer
• Some mathematical limitations of the general-purpose analog computer
• The extended analog computer
• An analogue-digital Church-Turing thesis
• Digital simulation of analog computation and Church's thesis
• The nature of the extended analog computer

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 Q5493754)