2000 character limit reached
Complexity of inversion of functions on the reals
Published 10 Dec 2024 in math.LO, cs.IT, math.IT, and math.PR | (2412.07592v2)
Abstract: We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.