factual

Game of Life Cell Aliveness Is Undecidable

Conway's Game of Life is a playground for computably undecidable questions: the question of whether a given cell will ever become alive in the evolution of a configuration is equivalent to the halting problem and is computably undecidable, though semi-decidable (if it becomes alive you find out at a finite stage).

factualpending

Speaker

Joel David Hamkins

Evidence Quote

“you can prove that the question of whether a given cell will ever become alive is computably undecidable... you can prove that that question is equivalent to the halting problem.”

Source

Joel David Hamkins— Lex Fridman Podcast
Created: 6/13/2026, 3:33:58 AM

Your notes

Loading notes...