Computational Complexity in Non-Turing Models of Computation

DOI10.1016/j.entcs.2011.01.003zbMath1347.68130OpenAlexW2315104758WikidataQ113318334 ScholiaQ113318334MaRDI QIDQ2825338

Ed Blakey

Publication date: 7 October 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.01.003

zbMATH Keywords

computational complexityprecisionnon-standard/non-Turing computational models

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Generic properties of a computational task predict human effort and performance ⋮ Computational Complexity in Non-Turing Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorizing RSA keys, an improved analogue solution
• Quantum algorithm for Hilbert's tenth problem
• Hypercomputation with quantum adiabatic processes
• The differential analyzer. A new machine for solving differential equations
• Computational Complexity in Non-Turing Models of Computation
• Link-Length Minimization in Networks

This page was built for publication: Computational Complexity in Non-Turing Models of Computation