arXiv Open Access 2017

Computability and Complexity of Unconventional Computing Devices

Hajo Broersma Susan Stepney Goran Wendin

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.ET

Penulis (3)

Hajo Broersma

Susan Stepney

Goran Wendin

Format Sitasi

APA MLA BibTeX

Broersma, H., Stepney, S., Wendin, G. (2017). Computability and Complexity of Unconventional Computing Devices. https://arxiv.org/abs/1702.02980

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓