arXiv:2412.07592 Abstract | arXiv Analytics

Published 2024-12-10Version 1

We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.

Categories: math.LO, cs.IT, math.IT, math.PR

Keywords: complexity, probabilistic inversions, partial computable functions

Related articles: Most relevant | Search more

arXiv:2410.00901 [math.LO] (Published 2024-10-01)

The Complexity of Proper Homotopy Equivalence of Graphs

arXiv:math/0408144 [math.LO] (Published 2004-08-11, updated 2004-11-15)

Is Complexity a Source of Incompleteness?

arXiv:1208.4803 [math.LO] (Published 2012-08-23)

The size of a formula as a measure of complexity