Revision as of 12:29, 10 May 2017 edit Fayenatic london (talk \| contribs) Autopatrolled, Administrators 346,542 edits PROD declined, it is not a duplicate. Start discussion on merge instead ← Previous edit		Revision as of 13:28, 3 July 2017 edit undo Magic links bot (talk \| contribs) Bots 291,110 edits m Replace magic links with templates per local RfC and MediaWiki RfC Next edit →
Line 51: == 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#List of 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. </ref><ref>Appel, K. and Haken, W. "The Solution of the Four-Color Map Problem." Sci. Amer. 237, 108–121, 1977.</ref>

Timeline of computational mathematics: Difference between revisions