Template:Selected anniversaries/May 19: Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
No edit summary
No edit summary
Line 38: Line 38:
||1942: Gary Kildall born ... American computer scientist and microcomputer entrepreneur who created the CP/M operating system and founded Digital Research, Inc. (DRI). Kildall was one of the first people to see microprocessors as fully capable computers, rather than equipment controllers, and to organize a company around this concept. Pic.
||1942: Gary Kildall born ... American computer scientist and microcomputer entrepreneur who created the CP/M operating system and founded Digital Research, Inc. (DRI). Kildall was one of the first people to see microprocessors as fully capable computers, rather than equipment controllers, and to organize a company around this concept. Pic.


||1942: Joseph Larmor dies ... physicist and mathematician who made innovations in the understanding of electricity, dynamics, thermodynamics, and the electron theory of matter. Pic: http://www.newulsterbiography.co.uk/index.php/home/viewPerson/825
||1942: Joseph Larmor dies ... physicist and mathematician who made innovations in the understanding of electricity, dynamics, thermodynamics, and the electron theory of matter. Pic.


||1949: György Elekes born ... mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension. Pic: https://adamsheffer.wordpress.com/2014/07/01/incidences-lower-bounds-part-2/
||1949: György Elekes born ... mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension. Pic: https://adamsheffer.wordpress.com/2014/07/01/incidences-lower-bounds-part-2/

Revision as of 03:22, 11 July 2019