The halting problem is undecidable. This implies that there is an algorithm to decide whether a given program P terminates on input w when P and w are both provided as input. True False

Quantum Algorithms Conquer a New Kind of Problem | Quanta Magazine

From High-Performance Computing to High-Performance Problem Solving

Can Neural Networks Be Turing Machines? Exploring the Limits of AI Computation

Reconstructing Turing's "Paper Machine"

Alan Turing