Computability and Complexity of Unconventional Computing Devices

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.

4 Figures and Tables

Cite this paper

@article{Broersma2017ComputabilityAC, title={Computability and Complexity of Unconventional Computing Devices}, author={Hajo Broersma and Susan Stepney and G{\"{o}ran Wendin}, journal={CoRR}, year={2017}, volume={abs/1702.02980} }