Complexity of inversion of functions on the reals

December 10, 2024 · The Ethereal · 🏛 Mathematical Structures in Computer Science

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors George Barmpalias, Mingyang Wang, Xiaoyan Zhang arXiv ID 2412.07592 Category math.LO: Logic Cross-listed cs.IT, math.PR Citations 2 Venue Mathematical Structures in Computer Science Last Checked 1 month ago
Abstract
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic