Computability and Complexity of Unconventional Computing Devices
Hajo Broersma, Susan Stepney, Goran Wendin
paper2017-02-09English
computational financearxiv
Description
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.