Advertisement

Computability and Complexity of Unconventional Computing Devices

  • Hajo Broersma
  • Susan Stepney
  • GÖran Wendin
Chapter
Part of the Natural Computing Series book series (NCS)

Abstract

We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve \(\mathcal{NP}\)-complete problems in polynomial time). We discover that all these claims rely on the provision of one or more unphysical resources.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Hajo Broersma
    • 1
  • Susan Stepney
    • 2
  • GÖran Wendin
    • 3
  1. 1.Faculty of Electrical Engineering, Mathematics and Computer Science, and MESA + Institute for NanotechnologyUniversity of TwenteEnschedeThe Netherlands
  2. 2.Department of Computer Science, and York Cross-disciplinary Centre for Systems AnalysisUniversity of YorkYorkUK
  3. 3.Applied Quantum Physics Laboratory, Microtechnology and NanoscienceChalmers University of TechnologyGothenburgSweden

Personalised recommendations