Revision as of 20:32, 6 September 2015 edit Ema--or (talk \| contribs) Extended confirmed users 3,156 edits m →1940s ← Previous edit		Revision as of 20:37, 6 September 2015 edit undo Ema--or (talk \| contribs) Extended confirmed users 3,156 edits →1940s Next edit →
Line 4: Von Neumann, J.; Richtmyer, R. D. Journal of Applied Physics, Vol. 21, pp. 232–237</ref> * 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], [[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> == 1950s ==

Timeline of computational mathematics: Difference between revisions