Order-free Recursion on the Real Numbers

DOI10.1002/MALQ.19970430206MaRDI QIDQ4336701zbMATH OpenOpenAlexFDO

Authors Vasco Brattka

Publication date 14 May 1997

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19970430206

zbMATH Keywords

computable functionsrecursive analysisapproximation without a test on the real numberseffective version of the Stone-Weierstraß approximation theoremmodels of computability on the real numbersrecursive partitions of unity

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Constructive and recursive analysis (03F60) Approximations and expansions (41A99)

Recommendations

• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• Recursive analysis characterized as a class of real recursive functions
• Relatively recursive reals and real functions
• Non-recursiveness of the operations on real numbers

Cites work

• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable

Cited in

(5)

• Computable invariance
• Non-recursiveness of the operations on real numbers
• scientific article; zbMATH DE number 4148069 (Why is no real title available?)
• Computation by `While' programs on topological partial algebras
• Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines

This page was built for publication: Order-free Recursion on the Real Numbers

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