Mathematics

• 1857 George Boole created Boolean Logic. The basics for all binary computers
  It is a logic with only two elements; (True or 1 & False or 0) - Binary.
  It has one unary operator: (not) (not 1 = 0 and not 0 = 1)
  It has three binary operators:
  (and): 0 and 0 = 0, 0 and 1 = 0, 1 and 0 = 0, 1 and 1 = 1
  (or): 0 or 0 = 0, 0 or 1 = 1, 1 or 0 = 1, 1 or 1 = 1
  (xor): 0 xor 0 = 1, 0 xor 1 = 0, 1 xor 0 = 0, 1 xor 1 = 0
  
  He also created the binary numeration system for Whole Numbers utilizing place-value ala Hindu-Arabic decimal system. 1,10,11,100,101 etc for 1,2,3,4,5 etc
  


• 1937 Alan Turing created the first Finite State Machine he called Turing Machine. An implementation of Boole's Logic which has evolved into our present day computers.
  


• 1957 I programmed my first Finite State Machines when I was working for United Way Charities. They used IBM Tabualting Machines for their data. These machines were not computers. They were single purpose Finite State Machines using IBM punch cards for their data. The machines functions were determined by a control plugboard of sockets. They were programmed by wiring the board. That is when I decided to go to Purdue University.
  
  


• 1958 In a Numerical Methods of Analysis class we programmed the University's mainframe computer to solve simultaneous linear equations. At that time there were no computer languages. We wrote our programs in the computer's binary just zeros and ones. Then we punched holes in a paper tape, fed it to the computer together with any data. The computer could only work on one job at a time. We had access to he computer at night when the administration was not needing it.
  


• 1959 While I was at Purdue, the first computer language (assembly language) was created. There was a mnemonic for each of the computer's instructions. Programmers could then write programs using assembly language and have a finite state machine translate it to computer's binary (now called object code.)