Computing with infinite objects

DOI10.1016/0304-3975(80)90011-0zbMath0473.68042OpenAlexW2075204971MaRDI QIDQ1158755

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)

Related Items

Limits of real numbers in the binary signed digit representation ⋮ PCF extended with real numbers ⋮ Constructing a quasi-uniform function space ⋮ On the complexity of online computations of real functions ⋮ A faithful computational model of the real numbers ⋮ Program extraction in exact real arithmetic ⋮ Unnamed Item ⋮ Arbitrary precision real arithmetic: design and algorithms ⋮ A certifying square root and division elimination ⋮ A refined model of computation for continuous problems ⋮ Integration in Real PCF ⋮ Computability of Self-Similar Sets ⋮ Admissible digit sets

Cites Work

• Theorie der Numerierungen I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item