scientific article; zbMATH DE number 517066

MaRDI QIDQ4282595zbMATH OpenFDO

Authors N. P. Bamber

Publication date 17 March 1994

zbMATH Keywords

definability theoremfractal geometrygeneralization of recursion theorymodel of computationparameterisation theoremreal algebraic numbersunlimited register machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Real computations with fake numbers
• scientific article; zbMATH DE number 4131650
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Real analytic machines and degrees: a topological view on algebraic limiting computation
• scientific article; zbMATH DE number 1405639

Cited in

(6)

• Analog computers and recursive functions over the reals.
• Execution trace sets for real computation
• scientific article; zbMATH DE number 1583881 (Why is no real title available?)
• Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds
• Experimental computation of real numbers by Newtonian machines
• The Turing degrees for some computation model with the real parameter

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