limits proof computation replacing g del 's universal arithmetic based formal language formal simple hypothetical devices became known turing machines proved machine would capable performing conceivable mathematical computation representable algorithm went prove solution ''entscheidungsproblem'' first showing halting problem turing machines undecidable general possible decide algorithmically whether given turing machine ever halt also introduced notion universal machine known
Formal science Computer science Social sciences History of computer hardware