Computation Model: Turing Machine
All systems with computation model: turing-machine
Systems (4)
Billiard-ball computer
f(x) = reversible boolean logic (Fredkin gate)
Proposed by Fredkin & Toffoli (1982). Balls travel on paths representing wires; presence/absence of a ball encodes a bit. Collisions at path intersections implement logic gates. Logically and thermody...
DNA computer (Adleman 1994)
f(x) = Hamiltonian path via strand hybridization
Leonard Adleman's 1994 demonstration solved the directed Hamiltonian path problem using DNA strand hybridization. Cities encoded as DNA sequences, flight connections as complementary strands. Massivel...
Quantum and quantum-inspired annealers
f(x) = Ising model energy minimization / QUBO optimization
Quantum and quantum-inspired systems for solving combinatorial optimization problems through annealing processes. Includes true quantum annealers (D-Wave) using superconducting qubits and quantum-insp...
Quantum gate computer (superconducting qubits)
f(x) = unitary transformations / quantum algorithms
Superconducting qubits manipulated by microwave pulses to perform unitary operations. Quantum gates like Hadamard, CNOT, and phase gates enable quantum algorithms such as Shor's factoring and Grover's...