Computational models for feasible real analysis

MaRDI QIDQ4035312zbMATH OpenFDO

Authors H. James Hoover

Publication date 18 May 1993

zbMATH Keywords

operatorsoracle Turing machineparallel computationsrecursive analysisuniform arithmetic circuit familiesuniform Boolean circuit families

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60)

Recommendations

• New Computational Paradigms
• On choosing the correct model for computability over the reals
• Computing over the reals: foundations for scientific computing.
• Real computations with fake numbers
• A survey of recursive analysis and Moore's notion of real computation

Cited in

(6)

• Computing finite-dimensional realizations
• Towards computable analysis on the generalised real line
• Models of computation for partial functions on the reals
• On choosing the correct model for computability over the reals
• Computation models and function algebras
• Real functions, contraction mappings, and P-completeness

This page was built for publication: Computational models for feasible real analysis

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