๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Non-recursiveness of the operations on real numbers

โœ Scribed by Kostas Skandalis


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
598 KB
Volume
71
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Recursive Approximability of Real Number
โœ Xizhong Zheng ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 359 KB

A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limit real number might have more effectivity. In this note we summarize some recent attempts to classify the recursively ap

Non-constructive Properties of the Real
โœ Paul Howard; Kyriakos Keremedis; Jean E. Rubin; Adrienne Stanley; Eleftherios Ta ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 159 KB ๐Ÿ‘ 1 views
On the finiteness of the recursive chrom
โœ William I. Gasarch; Andrew C.Y. Lee ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 559 KB

A recursive graph is a graph whose vertex and edge sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively determine the neighbors of a vertex. Both of these have been studied in the literature. We consider an intermediary notion:

On coalgebra of real numbers
โœ D. Pavloviฤ‡; V. Pratt ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB