Real numbers: From computable to random

Studia Philosophica 1 (2001)
  Copy   BIBTEX

Abstract

A real is computable if it is the limit of a computable, increasing, computably converging sequence of rational...

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Recursive Approximability of Real Numbers.Xizhong Zheng - 2002 - Mathematical Logic Quarterly 48 (S1):131-156.
The Arithmetical Hierarchy of Real Numbers.Xizhong Zheng & Klaus Weihrauch - 2001 - Mathematical Logic Quarterly 47 (1):51-66.
Normal Numbers and Limit Computable Cantor Series.Achilles Beros & Konstantinos Beros - 2017 - Notre Dame Journal of Formal Logic 58 (2):215-220.
Degree spectra of real closed fields.Russell Miller & Victor Ocasio González - 2019 - Archive for Mathematical Logic 58 (3-4):387-411.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
A Real Number Structure that is Effectively Categorical.Peter Hertling - 1999 - Mathematical Logic Quarterly 45 (2):147-182.
The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references