3 ms·
The Cha Cha Slide Is Turing Complete
- lupire 4y agoAlmost everything is Turing complete. All you need is a movable read/write head and an array of memory.
- westurner 4y agoTuring completeness: https://en.wikipedia.org/wiki/Turing_completeness https://en.wikipedia.org/wiki/Turing_completeness Church-Turing thesis: https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis Is Church-Turing expected to apply to concurrent, quantum computers? To actual quantum physical stimulation, or qubits, or qudits? Presumably there's already a quantum analog