Pages that link here:
enlightenment-completeness
[ Category - Philosophy ][ Category - Meditation ][ Category - Essays ]
In complexity theory, there is a concept of reduction, which (at a high level) is reducing one problem to another such that if you were to solve one, the other would also be solved (by using the same methodology you used to solve the first one)
Turing Machines
[ Category - Computer Science ][ complexity theory ]
Turing Machines
History
In his 1936 paper ON COMPUTABLE NUMBERS, WITH AN APPLICATION TO THE ENTSCHEIDUNGSPROBLEM, Alan Turing introduced the concept of a Turing Machine, which is a machine capable of performing any symbolic calculation - this is argued in the Church-Turing Thesis
index
β¨ First time here? Read the welcome message
Loading... articles read π€
clear progress? π¨