Order-free Recursion on the Real Numbers

DOI10.1002/MALQ.19970430206zbMATH Open0876.03022OpenAlexW1971896911MaRDI QIDQ4336701FDOQ4336701

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable

Cited In (5)

• Title not available (Why is that?)
• Computable invariance
• Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
• Non-recursiveness of the operations on real numbers
• Computation by `While' programs on topological partial algebras

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)