Content deleted Content added
Line 7:
* Ulam and von Neumann introduce the notion of cellular automata.<ref>Von Neumann, J., Theory of Self-Reproduiing Automata, Univ. of Illinois Press, Urbana, 1966.</ref>
* [[Manchester Small-Scale Experimental Machine#First programs|A routine for the Manchester Baby]] written to factor a large number (2^18), one of the first in [[computational number theory]].<ref>[http://curation.cs.manchester.ac.uk/digital60/www.digital60.org/birth/manchestercomputers/mark1/manchester.html The Manchester Mark 1.]</ref> The Manchester group would make several other breakthroughs in [[Mersenne primes|this area]].<ref>[http://curation.cs.manchester.ac.uk/digital60/www.digital60.org/about/glossary/notes.html#mersenne Miscellaneous Notes: Mersenne Primes.] [http://www.cs.manchester.ac.uk/Digital60/Digital 60 Manchester - 60 years of the Modern Computer]{{Dead link|date=July 2018 |bot=InternetArchiveBot |fix-attempted=no }}, [[University of Manchester|Manchester Uni.]] CS Curation website.</ref><ref>[http://news.bbc.co.uk/2/hi/technology/7465115.stm One tonne 'Baby' marks its birth: Dashing times.] By Jonathan Fildes, Science and technology reporter, BBC News.</ref>
* Dantzig introduces the [[simplex method|simplex algorithm]] (voted one of the top 10 algorithms of the 20th century) in 1947.<ref>{{cite web|title=SIAM News, November 1994.|url=http://www.stanford.edu/group/SOL/dantzig.html|accessdate=6 June 2012}} Systems Optimization Laboratory, Stanford University Huang Engineering Center (site host/mirror).</ref>
== 1950s ==
| |||