$L^2$-Betti numbers and computability of reals
Clara Loeh, Matthias Uschold

TL;DR
This paper investigates the computability of real numbers derived from $L^2$-Betti numbers and torsion in groups, focusing on how their computability relates to the Turing degree of the word problem.
Contribution
It introduces a framework connecting $L^2$-invariants of groups with computability theory, exploring how these invariants' degrees depend on the group's word problem.
Findings
Establishes links between $L^2$-invariants and Turing degrees.
Shows certain $L^2$-Betti numbers are non-computable.
Provides insights into the complexity of invariants in geometric group theory.
Abstract
We study the computability degree of real numbers arising as -Betti numbers or -torsion of groups, parametrised over the Turing degree of the word problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Mathematical Dynamics and Fractals
