Content deleted Content added
→1940s: fix ref |
Randy Kryn (talk | contribs) →2000s: uppercase per direct link (Rubik's Cube) |
||
(2 intermediate revisions by 2 users not shown) | |||
Line 8:
* First [[Computational Fluid Dynamics|hydro simulations]] at Los Alamos occurred.<ref>Richtmyer, R. D. (1948). Proposed Numerical Method for Calculation of Shocks. Los Alamos, NM: Los Alamos Scientific Laboratory LA-671.</ref><ref>A Method for the Numerical Calculation of Hydrodynamic Shocks.
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-
* [[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://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>
* LU decomposition technique first discovered.
Line 60:
== 1970s ==
* Mandelbrot, from studies of the [[Fatou set|Fatou]], [[Julia set|Julia]] and [[Mandelbrot set]]s, coined and popularized the term 'fractal' to describe these structures' [[self-similarity]].<ref>B. Mandelbrot; ''Les objets fractals, forme, hasard et dimension '' (in French). Publisher: Flammarion (1975), {{ISBN|9782082106474}}; English translation ''Fractals: Form, Chance and Dimension.'' Publisher: Freeman, W. H & Company. (1977). {{ISBN|9780716704737}}.</ref><ref>Mandelbrot, Benoît B.; (1983). The Fractal Geometry of Nature. San Francisco: W.H. Freeman. {{ISBN|0-7167-1186-9}}.</ref>
*Kenneth Appel and Wolfgang Haken prove the [[four colour theorem]], the [[Computer-assisted proof#Theorems proved with the help of computer programs|first theorem to be proved by computer]].<ref>Kenneth Appel and Wolfgang Haken, "Every planar map is four colorable, Part I: Discharging," Illinois Journal of Mathematics 21: 429–490, 1977.</ref><ref>Appel, K. and Haken, W. "Every Planar Map is Four-Colorable, II: Reducibility." Illinois J. Math. 21, 491–567, 1977.
Line 73 ⟶ 72:
==2000s==
*In computational group theory, [[Optimal solutions for Rubik's Cube|God's Number]] for the [[Rubik's
*Mathematicians completely map the E8-group.<ref>[https://news.mit.edu/2007/e8 Math research team maps E8: Calculation on paper would cover Manhattan.] MIT News. Elizabeth A. Thomson, News Office; March 18, 2007.</ref><ref>[https://www.math.columbia.edu/~woit/wordpress/?p=534 E8 Media Blitz], [[Peter Woit]].</ref><ref>[https://www.huliq.com/15695/mathematicians-map-e8 Mathematicians Map E8.] {{Webarchive|url=https://web.archive.org/web/20150924032322/http://www.huliq.com/15695/mathematicians-map-e8 |date=2015-09-24 }} By Armine Hareyan 2007-03-20 02:21.</ref>
==2010s==
* Hales completes the proof of Kepler's conjecture.<ref>[http://blog.kleinproject.org/?p=742 What is the way of packing oranges? —
</ref>
|