Computability and Complexity of Unconventional Computing Devices
Emerging Technologies
2017-03-24 v2
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.
Cite
@article{arxiv.1702.02980,
title = {Computability and Complexity of Unconventional Computing Devices},
author = {Hajo Broersma and Susan Stepney and Goran Wendin},
journal= {arXiv preprint arXiv:1702.02980},
year = {2017}
}
Comments
to appear in "Computational Matter". Stepney, Rasmussen, Amos, eds. Springer 2017