Regainingly approximable numbers and sets
From MaRDI portal
Publication:6508378
DOI10.1017/JSL.2024.5zbMatharXiv:2301.03285MaRDI QIDQ6508378
Unnamed Author, Peter H. Hertling, Rupert Hölzl
Publication date: 1 January 1
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
This page was built for publication: Regainingly approximable numbers and sets