# 

ІмЯ рік Країна Наука 
Досягнення 
961 

Jean E. Sammet
0
інформатика

Developed the FORMAC programming language. She was also the first to write extensively about the history and categorization of programming languages in 1969, and became the first female president of the Association for Computing Machinery in 1974.

962 

Banū Mūsā
0
інформатика

The Banū Mūsā brothers wrote the Book of Ingenious Devices, where they described what appears to be the first programmable machine, an automatic flute player.[9]

963 

Yoshiro Nakamatsu
0
інформатика

Invented the first floppy disk at Tokyo Imperial University in 1950,[10][11] receiving a 1952 Japanese patent[12][13] and 1958 US patent for his floppy magnetic disk sheet invention,[14] and licensed to Nippon Columbia in 1960[15] and IBM in the 1970

964 

Akira Nakashima
0
інформатика

NEC engineer introduced switching circuit theory in papers from 1934 to 1936, laying the foundations for digital circuit design, in digital computers and other areas of modern technology.

965 

Pāṇini
0
інформатика

Ashtadhyayi Sanskrit grammar was systematised and technical, using metarules, transformations, and recursions, a forerunner to formal language theory and basis for PaniniBackus form used to describe programming languages.

966 

Alan Perlis
0
інформатика

On Project Whirlwind, member of the team that developed the ALGOL programming language, and the first recipient of the Turing Award





967 

Pier Giorgio Perotto
0
інформатика

Designer of Olivetti Programma 101, the first personal computer.

968 

Rózsa Péter
0
інформатика

Published a series of papers grounding recursion theory as a separate area of mathematical research, setting the foundation for theoretical computer science.

969 

Rosalind Picard
0
інформатика

Founded Affective Computing, and laid the foundations for giving computers skills of emotional intelligence.

970 

Emil L. Post
0
інформатика

Developed the Post machine as a model of computation, independently of Turing. Known also for developing truth tables, the Post correspondence problem used in recursion theory as well as proving what is known as Post's theorem.
