On the incomputability of computable dimension

04/30/2019
by   Ludwig Staiger, et al.
0

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions amight be incomputable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2022

Epi-constructivism: Decidable sets of computable numbers as foundational objects for mathematics

It is well known that the R, the set of real numbers, is an abstract set...
research
02/20/2023

On minimal easily computable dimension group algebras

Finite semisimple commutative group algebras for which all the minimal i...
research
01/31/2018

On the computability of graphons

We investigate the relative computability of exchangeable binary relatio...
research
03/09/2023

Uniform Tests and Algorithmic Thermodynamic Entropy

We prove that given a computable metric space and two computable measure...
research
05/22/2018

Computable Variants of AIXI which are More Powerful than AIXItl

This paper presents Unlimited Computable AI, or UCAI, that is a family o...
research
08/15/2023

Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals

We establish that constructive continued fraction dimension originally d...
research
10/11/2022

Strong negation in the theory of computable functionals TCF

We incorporate strong negation in the theory of computable functionals T...

Please sign up or login with your details

Forgot password? Click here to reset