The trans-Turing Machine
2 likes376 views
This document discusses the limitations of the Turing Machine model of computation and proposes alternatives such as simulated annealing and adiabatic quantum computation. It provides examples of computational problems like the traveling salesman problem that become statistical physical problems when viewed through this new lens. The document also discusses using adiabatic quantum computers like D-Wave for problems like map coloring and describes programming the D-Wave for such problems by mapping the problem onto the unit cell and considering neighbors and cloning through the programming code and GUI.
The trans-Turing Machine
- 1. The trans-Turing Machine Gábor Vattay Dept. of Physics of Complex Systems, Eötvös University
- 5. Non-computable numbers, halting problem, Gödel …
- 6. Complexity
- 7. Road trip stopping at major U.S. landmarks
- 19. Computational complexity 2.0 Number of steps a TM takes to solve the problem Number of steps a TM takes to solve the problem in the worst case Average time needed to solve a probable instance of the problem Computational problems become statistical physical problems Worst case scenario is astronomically improbable in the thermodynamic limit (infinit number of cities) Simulated annealing is the best heuristic method as of today
- 28. D-Wave
- 43. Objectives
- 45. Maping onto the unit cell
- 46. Code
- 48. GUI
- 49. Chunks
- 52. GUI
- 53. Outlook
- 55. FMO as a little quantum computer Fleming and Engel (Nature, 2007)
- 56. FMO is searching the energy minimum