Computability and Complexity of Unconventional Computing Devices
classification
💻 cs.ET
keywords
claimsdevicesperformcertaincomplexitycomputabilitycomputationcompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.