Digital computer development

Digital computer development

The principle in the modern computer was first described by mathematician and revolutionary computer scientist Alan Turing , who set out the thought in his seminal 1936 paper, [20] On Computable Figures. Turing reformulated Kurt Gödel 's 1931 results on the boundaries of proof and computation, replacing Gödel's universal arithmetic-based formal language while using formal and simple hypothetical devices that became known as Turing models . He proved that some such machine would be competent at performing any conceivable mathematical computation if it were representable just as one algorithm . He went on to prove that there was no strategy to the Entscheidungsproblem by first showing that the halting problem pertaining to Turing machines is undecidable : in general, it is impossible to decide algorithmically whether a given Turing machine will ever before halt.
He also introduced the notion of a 'Universal Machine' (now generally known as a Universal Turing machine ), with the idea that a real machine could perform the tasks of any other machine, or basically, it is provably capable of computing anything that is computable by executing a plan stored on tape, allowing the machine to be programmable. Von Neumann acknowledged that the central concept of the modern computer was just for this paper. Turing machines are to this day a central. object of study in theory of computation . Except for the limitations imposed by his or her finite memory stores, modern computers are said to be Turing-complete , and that is to say, they have algorithm execution capability equivalent to your universal Turing machine .