L^2-Betti numbers and computability of reals

02/07/2022
by   Clara Loeh, et al.
0

We study the computability degree of real numbers arising as L^2-Betti numbers or L^2-torsion of groups, parametrised over the Turing degree of the word problem. Moreover, we explain how such considerations can be modelled in a proof assistant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2018

Undecidable word problem in subshift automorphism groups

This article studies the complexity of the word problem in groups of aut...
research
04/19/2023

The physical Church-Turing thesis and non deterministic computation over the real numbers

On the real numbers, the notions of a semi-decidable relation and that o...
research
03/11/2021

On Hardy's Apology Numbers

Twelve well-known "Recreational" numbers are generalized and classified ...
research
03/12/2020

Four heads are better than three

We construct recursively-presented finitely-generated torsion groups whi...
research
09/03/2021

Betwixt Turing and Kleene

Turing's famous 'machine' model constitutes the first intuitively convin...
research
08/03/2020

Using Expander Graphs to test whether samples are i.i.d

The purpose of this note is to point out that the theory of expander gra...
research
03/06/2018

Co-occurrence of the Benford-like and Zipf Laws Arising from the Texts Representing Human and Artificial Languages

We demonstrate that large texts, representing human (English, Russian, U...

Please sign up or login with your details

Forgot password? Click here to reset