Computable irrational numbers with representations of surprising complexity

, &
Annals of Pure and Applied Logic 172 (2):102893 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2020.102893

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Randomness for computable measures and initial segment complexity.Rupert Hölzl & Christopher P. Porter - 2017 - Annals of Pure and Applied Logic 168 (4):860-886.
Representations of the real numbers and of the open subsets of the set of real numbers.Klaus Weihrauch & Christoph Kreitz - 1987 - Annals of Pure and Applied Logic 35 (C):247-260.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Computable de Finetti measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.
Computable neighbourhoods of points in semicomputable manifolds.Zvonko Iljazović & Lucija Validžić - 2017 - Annals of Pure and Applied Logic 168 (4):840-859.
Finite computable dimension and degrees of categoricity.Barbara F. Csima & Jonathan Stephenson - 2019 - Annals of Pure and Applied Logic 170 (1):58-94.
The complexity of central series in nilpotent computable groups.Barbara F. Csima & Reed Solomon - 2011 - Annals of Pure and Applied Logic 162 (8):667-678.
Computable fields and the bounded Turing reduction.Rebecca M. Steiner - 2012 - Annals of Pure and Applied Logic 163 (6):730-742.

Analytics

Added to PP
2020-10-07

Downloads
46 (#478,781)

6 months
6 (#851,135)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
Continued fractions of primitive recursive real numbers.Ivan Georgiev - 2015 - Mathematical Logic Quarterly 61 (4-5):288-306.
Real numbers, continued fractions and complexity classes.Salah Labhalla & Henri Lombardi - 1990 - Annals of Pure and Applied Logic 50 (1):1-28.

Add more references