David MacKay (scientist)
From Wikipedia, the free encyclopedia
David J.C. MacKay (born April 22, 1967) is the professor of natural philosophy in the department of Physics at the University of Cambridge. He was born the fifth child of Donald MacCrimmon MacKay and Valerie MacKay. He was educated at Newcastle High School (later Newcastle-under-Lyme School) and represented Britain in the International Physics Olympiad in Yugoslavia in 1985, receiving the first prize for experimental work. He went up to Trinity College, Cambridge and received a BA in Natural Sciences (Experimental and Theoretical Physics) in 1988. He went to the California Institute of Technology (Caltech) as a Fulbright Scholar. His supervisor in the graduate programme in Computation and Neural Systems was John Hopfield. He was awarded a PhD in 1992. In January 1992 he was made the Royal Society Smithson Research Fellow at Darwin College, Cambridge, continuing his cross-disciplinary research in the Cavendish Laboratory, the Department of Physics of the University of Cambridge. In 1995 he was made a University Lecturer in the Cavendish Laboratory. He was promoted in 1999 to a Readership and in 2003 to a Professorship in Natural Philosophy.
His contributions in machine learning and information theory include the development of Bayesian methods for neural networks, the rediscovery (with Radford M. Neal) of low-density parity-check codes, and the invention of Dasher, a software application for communication especially popular with disabled people.
His publications include a textbook, Information Theory, Inference, and Learning Algorithms, Cambridge University Press, Cambridge, UK, 2003 ISBN 0-521-64298-1. Online.
His interests beyond research include the development of effective teaching methods and African development; he taught regularly at the African Institute for Mathematical Sciences in Cape Town from its foundation in 2003 to 2006.
He has an Erdős number of 2.
[edit] Books
- MacKay, David J.C. (September 2003). Information Theory, Inference and Learning Algorithms. Cambridge: Cambridge University Press. ISBN 0-521-64298-1.