Thursday, June 23, 2016

Alan Turing

Happy Birthday Alan Turing

Father of "Theory of Computations"

1912 - Born on June 23, Warrington Crescent, 2, London W9, UK.

1922 - Studied at the Preparatory School of Hazelhurst.

1926 - He attended high school at Sherborne School in Dorset.

1931 - He began to study mathematics at Kings College, Cambridge.

1935 - He was elected an associate member of Kings College.

1936 - Publishes his most important theoretical work: On computable numbers with an application for Entsheidungsproblem. From this work, fundamental to modern computer science. Moved from Cambridge to Princeton University, USA, to continue his research.

1938 - concluded his doctoral thesis: Systems of logic based on ordinals. He returned to his seat in Kings.

1939 - He started to live at Bletchley Park, the first day of the second guerra.Começa decipher the codex of the naval version of the Enigma machine. Banburismus invented and designed the Bombe.

1940 - Completes first bombe, named Victoria, located in Cabin 8.

1941 - Break the codes of the naval version of the Enigma machine for the first time, contributing decisively to the submarine warfare.

1942 - Added to the team effort trying to decipher the German Lorenz machine. Turingismus invented, the first systematic method to break the Lorenz codes and the precursor of the methods used in Colossus. He crossed the Atlantic to contact the American codebreakers and builders of the Bombe.

1943 - Began work on voice encryption in Hanslope Park.

1945 - Joined the National Physical Laboratory (NPL) in Teddington and designed the ACE computer.

1945 - Awarded the OBE for his services in WWII.

1946 - It began a cycle of lectures on computer design, in London, between December 1946 and February 1947.

1954 - Death by cyanide poisoning.

Sunday, February 1, 2015

Example of Language Regular Expression and DFA

Example of Language , Regular Expression and DFA.

L = { x / x is start or end with 00 or 11 }

Regular Expression : (00 + 11) (0 + 1)* + (0 + 1)* (00 + 11)

Deterministic Finite Automata (DFA):