Computability and Complexity of Unconventional Computing Devices
Hajo Broersma, Susan Stepney, Goran Wendin
TL;DR
This paper critically examines claims about unconventional computing devices performing hypercomputation or solving NP-complete problems efficiently, revealing these claims depend on unphysical resources and are thus not feasible.
Contribution
It provides a rigorous analysis showing that claims of hypercomputation and super-Turing capabilities rely on unphysical assumptions, challenging their validity.
Findings
Claims of hypercomputation rely on unphysical resources
Super-Turing computation claims depend on unrealistic assumptions
Physical constraints invalidate these computational claims
Abstract
We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims rely on the provision of one or more unphysical resources.
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
TopicsQuantum Computing Algorithms and Architecture · Cellular Automata and Applications · Advanced Memory and Neural Computing