It is a common belief that Computer Science is a very recent discipline, developed in the last century with the diffusion of computers and, even more recently, with the pervasive nature of internet and the Web. On the contrary, the fundamental notions of this “new” scientific discipline are the notion of algorithm, i.e. a finite method for providing a solution to a generic problem, often expressed as a calculus (of an area, of a path, of a quantity of time, etc.), the notion of formal language and the notion of automaton or computing machine. If we accept this point of view, the historic roots of Computer Science can be traced back to the development of algorithmic methods, already very sophisticated in the Egyptian era, and of mechanical device for aiding the calculus. History of Computer Science, Automata , Logic and Technology are strictly related: we only recall various mechanical devices for measuring time (clocks), for industrial applications (looms), for leisure (carillons), and, of course, for calculating (abaci, Pascal’s machine.). Particularly fascinating, also from a philosophical point of view, are mechanical devices that aim to simulate human beings or, more generally, living beings; “organic” mechanisms that in the 17th century had their first golden age, but that have a second golden age nowadays, called robots. A turning point in this long history of mechanical devices, in the 20th century, is the consequence of the fundamental works of Turing, Goedel, Von Neumann: the new theoretical development on automata provides a precise definition of computing machine, together with a deep comprehension of its computational limits. Furthermore, the new idea of communicating machines leads to nets, distributed calculus, internet and the Web, with its enormous sociological impact.
In this course we will approach some of these above described topics, in particular:
- Numbers and enumeration systems (2h)
- History of binary (2h)
- Historical algorithms. Egypt multiplication, Euclides, ... (2h)
- Ancient instruments for calculi: Antikytera, tables, abacus, Napier's bones (2h)
- Mechanical calculators: Pascaline, Leibniz (2h)
- Babbage 's nmachines, Ada Lovelace and Menabrea, discussion (3h)
-Cryptography: Cesar's cifre, Vigenere, Babbage (2h)
- Enigma and other machines (2h)
- Computers: Zuse, Turing, Von Neumann , Shannon (3h)
- Automata: legends and literature (1h)
- Automata: Hero, medioeval period (2h)
- Descartes and La Mettrie (2h)
- Vaucanson, Droz (2h)
- The Turk and E.A.Poe, chess and computers (2h)
- Logics, from Aristotele to Hilbert, Goedel e Turing (6h)
- Turing, Calcolability and Artificial Intelligence, Church-Turing Thesis and Cimputer science (4h)
- McCulloch Pitts and finite state automata (2h)
- Chomsky, grammars and artificial programming languages (2h)
- From Turing to Cybernetics and Artificial Intelligence.Modern automata: robot, android, cyborg, discussion (6h)
- Computer science in Italy: Boehm- Jacopini, Perotto and Olivetti, Padre Busa and hypertexts, cybernetics (4h)
- Internet, Web and networks (2h)