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.
翻译:我们研究实际数字的可计算性程度,实际数字是2美元-贝蒂数字或2美元-一组数字的可计算性,与字词问题的图灵程度相仿,此外,我们解释如何在证明助理中模拟这种考虑。