Computing with infinite objects

DOI10.1016/0304-3975(80)90011-0MaRDI QIDQ1158755zbMATH OpenOpenAlexFDO

Authors E. Wiedmer

Publication date 1980

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(80)90011-0

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites work

• scientific article; zbMATH DE number 3145228 (Why is no real title available?)
• scientific article; zbMATH DE number 3492141 (Why is no real title available?)
• scientific article; zbMATH DE number 3566181 (Why is no real title available?)
• scientific article; zbMATH DE number 3214998 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342794 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Theorie der Numerierungen I

Cited in

(14)

• Asymptotic speedup via effect handlers
• A refined model of computation for continuous problems
• Constructing a quasi-uniform function space
• Integration in Real PCF
• Program extraction in exact real arithmetic
• PCF extended with real numbers
• Computability of Self-Similar Sets
• Limits of real numbers in the binary signed digit representation
• On the complexity of online computations of real functions
• Arbitrary precision real arithmetic: design and algorithms
• A certifying square root and division elimination
• scientific article; zbMATH DE number 3932271 (Why is no real title available?)
• Admissible digit sets
• A faithful computational model of the real numbers

This page was built for publication: Computing with infinite objects

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