Jump to content

Stephen Wolfram: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
Mrroygbiv (talk | contribs)
40 edits
Line 35: Line 35:
He received his [[Doctor of Philosophy|Ph.D.]] in particle physics from [[Caltech]] at age 20<ref> Thesis listing: [http://www.slac.stanford.edu/spires/find/hep/www?fa=Wolfram,+Stephen+and+k+thesis Some Topics In Theoretical High-Energy Physics]</ref> and joined the faculty there. He became highly interested in [[cellular automata]] at age 21. <ref name=bio/> His work with Geoffrey Fox on the theory of the [[Quantum chromodynamics|strong interaction]] is still used today in experimental particle physics.<ref>See [http://www.slac.stanford.edu/spires/find/hep/www?j=NUPHA,B168,285 A Model for Parton Showers in QCD] and [http://www.slac.stanford.edu/spires/find/hep/www?j=PRLTA,41,1581 Observables for the Analysis of Event Shapes in e+ e- Annihilation and Other Processes]</ref>
He received his [[Doctor of Philosophy|Ph.D.]] in particle physics from [[Caltech]] at age 20<ref> Thesis listing: [http://www.slac.stanford.edu/spires/find/hep/www?fa=Wolfram,+Stephen+and+k+thesis Some Topics In Theoretical High-Energy Physics]</ref> and joined the faculty there. He became highly interested in [[cellular automata]] at age 21. <ref name=bio/> His work with Geoffrey Fox on the theory of the [[Quantum chromodynamics|strong interaction]] is still used today in experimental particle physics.<ref>See [http://www.slac.stanford.edu/spires/find/hep/www?j=NUPHA,B168,285 A Model for Parton Showers in QCD] and [http://www.slac.stanford.edu/spires/find/hep/www?j=PRLTA,41,1581 Observables for the Analysis of Event Shapes in e+ e- Annihilation and Other Processes]</ref>


Stephen Wolfram was in 1987 founding editor of the journal [[Complex Systems (journal)|Complex systems]].
Stephen Wolfram was in 1987 founding editor of the journal [[Complex Systems (journal)|Complex systems]]. Stephen Wolfram is endlessly
in controversial disputes with many academics.


== Work ==
== Work ==

Revision as of 07:32, 30 March 2009

Stephen Wolfram
Born (1959-08-29) 29 August 1959 (age 65)
London, England, UK
NationalityBritish
Alma materOxford University, Caltech
Known forCreator of Mathematica
Author of A New Kind of Science
AwardsMacArthur Fellowship
Scientific career
FieldsMathematics, Physics
InstitutionsWolfram Research

Stephen Wolfram (born 29 August 1959 in London) is a British physicist, mathematician and businessman known for his work in theoretical particle physics, cosmology, cellular automata, complexity theory, and computer algebra.

Biography

Stephen Wolfram's parents were Jewish refugees who immigrated from Westphalia to England in 1933.[1][2] Wolfram's father, Hugo Wolfram, was a novelist, and his mother, Sybil Wolfram, was a professor of philosophy at the University of Oxford. Wolfram was educated at Eton. Often described as a child prodigy, he published an article on particle physics at age 16[3] and entered Oxford University (St John's College) at age 17. He wrote a widely cited paper on heavy quark production at age 17.[2]

He received his Ph.D. in particle physics from Caltech at age 20[4] and joined the faculty there. He became highly interested in cellular automata at age 21. [2] His work with Geoffrey Fox on the theory of the strong interaction is still used today in experimental particle physics.[5]

Stephen Wolfram was in 1987 founding editor of the journal Complex systems. Stephen Wolfram is endlessly in controversial disputes with many academics.

Work

Symbolic Manipulation Program

Wolfram led the development of the computer algebra system SMP (Symbolic Manipulation Program: SMP was essentially Version Zero of Mathematica) in the Caltech physics department during 1979–1981, but a dispute with the administration over the intellectual property rights regarding SMP—patents/copyrights and faculty involvement in commercial ventures—eventually caused him to resign from Caltech.[6] SMP was further developed and marketed commercially by Inference Corp. of Los Angeles during the period 1983–1988.

In 1981, Wolfram was awarded a MacArthur Fellowship. In 1983, he left for the School of Natural Sciences of the Institute for Advanced Study, where he studied cellular automata, mainly with computer simulations. In the middle 1980s Wolfram worked on simulations of physical processes (such as turbulent fluid flow) with cellular automata on the Connection Machine alongside Richard Feynman.[7]

Mathematica

Main article: Mathematica

In 1986 Wolfram left the Institute for Advanced Study for the University of Illinois at Urbana-Champaign where he founded their Center for Complex Systems Research and started to develop the computer algebra system Mathematica, which was first released in 1988, when he left academia. In 1987 he co-founded a company called Wolfram Research which continues to develop and market the program.[2] Stephen Wolfram is currently the majority shareholder.

A New Kind of Science

Main article: A New Kind of Science

From 1992 to 2002, he worked on his controversial book A New Kind of Science (NKS), which presents an empirical study of very simple computational systems. Additionally, it argued that for fundamental reasons these types of systems, rather than traditional mathematics, are needed to model and understand complexity in nature. Wolfram's conclusion is that the universe is digital in its nature, and runs on fundamental laws which can be described as simple programs; cellular automata. He predicts a realization of this within the scientific communities will have a major and revolutionary influence on physics, chemistry and biology and the majority of the scientific areas in general, which is the reason for the book's title.

Since the release of the NKS book in 2002, Wolfram has split his time between developing Mathematica and encouraging people to get involved with NKS by giving talks, holding NKS conferences, and starting an NKS summer school.

The simplest Universal Turing machine

In the NKS book, Wolfram claimed to have found the simplest known Universal Turing machine, one with 2 states and 5 colors. Afterwards, Wolfram made an empirical investigation of 2,985,984 (= 126) possible 2-state 3-color Turing machines (because it was known that no machine with 2 states and 2 colors can be universal), and from among these candidates he selected one that he had an intuition might indeed be the simplest universal Turing machine.

A US$25,000 prize[8] was announced to be awarded to the first person or group who would provide a formal proof that that particular candidate is universal or that it is not. Alex Smith, a 20-year-old undergraduate from Birmingham, UK, claimed to have proven the universality of Wolfram's 2,3 Turing machine and was awarded the prize.[9] Computer scientist Vaughan Pratt later claimed to have found an error in the reasoning of the proof.[10] Wolfram Research and Alex Smith disputed Pratt's claim on the same discussion group.[11][12][13]

Computational knowledge engine

In March 2009, Wolfram announced Wolfram|Alpha, a computational data engine with a new approach to knowledge extraction and an easy-to-use interface, to be launched in May 2009.[14][15] The engine is based on natural language processing, a large library of algorithms and an NKS approach to answering queries. [16] The Wolfram|Alpha engine differs from traditional search engines in that it does not simply return a list of results based on a query, but instead computes an answer. Nova Spivack opined that "it could be as important as Google".[17]

References

  1. ^ Jüdische Schriftsteller in Westfalen: Hugo Wolfram
  2. ^ a b c d Stephen Wolfram
  3. ^ "Hadronic Electrons?". Note that the SPIRES date of April 1975 refers to the date the preprint was received, not the date of journal publication.
  4. ^ Thesis listing: Some Topics In Theoretical High-Energy Physics
  5. ^ See A Model for Parton Showers in QCD and Observables for the Analysis of Event Shapes in e+ e- Annihilation and Other Processes
  6. ^ Kolata, Gina. "Caltech Torn by Dispute Over Software," Science, 27 May 1983 (Vol. 220, No. 4600) issue, pgs. 932-934.
  7. ^ W. Daniel Hillis (1989-02). "Richard Feynman and The Connection Machine". Physics Today. Retrieved 3 November 2006. {{cite web}}: Check date values in: |date= (help); Unknown parameter |dateformat= ignored (help)
  8. ^ "The Prize Announcement; Looking for the formal proof".
  9. ^ "The Prize Is Won; The Simplest Universal Turing Machine Is Proved". The 24 October entry at Wolfram Research's blog announcing the news.
  10. ^ "Argument against the proof claimed in the FOM list".
  11. ^ "Stephen Wolfram reply in the FOM list".
  12. ^ "Todd Rowland reply to Vaughan Pratt in the FOM list".
  13. ^ "Alex Smith reply to Vaughan Pratt in the FOM list".
  14. ^ Wolfram, Stephen (2009-03-05). "Wolfram|Alpha Is Coming!". Wolfram blog. Retrieved 2009-03-09.
  15. ^ "Wolfram|Alpha". Retrieved 2009-03-09.
  16. ^ T he availability of an API will allow other applications to extend and enhance Alpha. Johnson, Bobbie (2009-03-09). "British search engine 'could rival Google'". The Guardian. Retrieved 2009-03-09.
  17. ^ T he availability of an API will allow other applications to extend and enhance Alpha. Spivack, Nova (2009-03-07). "Wolfram Alpha is Coming -- and It Could be as Important as Google". Nova Spivack - My Public Twine. Twine. Retrieved 2009-03-09.

Further reading


Template:Persondata

Retrieved from "https://en.wikipedia.org/w/index.php?title=Stephen_Wolfram&oldid=280598920"