Emil Post
(2 articles)
1931
Decidability
Whether a problem can be algorithmically solved, meaning there exists a clear procedure (algorithm) that will determine a yes-or-no answer for any given input within a finite amount of time.
Generality: 861
1936
Church-Turing Thesis
A hypothesis proposing that any computational problem solvable by a human using algorithms can also be solved by a Turing machine, which forms a foundation for the theoretical limits of computation.
Generality: 500