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
โฆ 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 note on non-extensional operations in
โ
A.S Troelstra
๐
Article
๐
1977
๐
Elsevier Science
โ 445 KB
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 theory of recursion operators
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 74 KB
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