Computability and Complexity of Unconventional Computing Devices

Broersma, Hajo
Stepney, Susan
Wendin, Göran
Stepney, Susan
Rasmussen, Steen
Amos, Martyn

Open link

Publication date

July 2018

DOI

10.1007/978-3-319-65826-1_11

Publisher

Springer Science and Business Media LLC

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

Extracted data

We use cookies to provide a better user experience.

Data Protection

Computability and Complexity of Unconventional Computing Devices

Abstract

Extracted data

Computability and Complexity of Unconventional Computing Devices

Abstract

Extracted data

Related items

Related items