Alvin Li

 CS Editor (Fall 2020-),
Computer Science

Turing Machines and the Halting Problem

by Alvin Li | March 2021

Turing Machines are the most basic logical representations of computers in theoretical computer science. It can be shown using this construct that the Halting Problem is undecidable, and this has many implications elsewhere in computability theory and other decision problems.

Continue reading