Effective completeness for real computation
Wesley Calvert
TL;DR
This paper discusses the concept of effective completeness in real computation, but the main result previously claimed was found to be incorrect, prompting a reevaluation of the findings.
Contribution
The paper revises previous claims about effective completeness in real computation and clarifies the correct results and remaining open questions.
Findings
Main result was incorrect as previously claimed
Provides corrected analysis and remaining open problems
Clarifies the theoretical landscape of real computation
Abstract
The main result of this paper, as previously presented to arxiv, was incorrect. See the full text for details and for reference to the remaining results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Formal Methods in Verification · Numerical Methods and Algorithms