Stephen Wolfram

From Wikipedia, the free encyclopedia

(Redirected from Steven Wolfram)
Jump to: navigation, search
Stephen Wolfram

Born August 29, 1959 (1959-08-29) (age 48)
Flag of England London, England, UK
Residence Cambridge, Massachusetts
Nationality British
Field Mathematician
Institutions Wolfram Research
Alma mater Oxford University, Caltech
Known for Creator of Mathematica
Author of A New Kind of Science
Notable prizes MacArthur Fellowship

Stephen Wolfram (born August 29, 1959 in London) is a physicist known for his work in theoretical particle physics, cellular automata, complexity theory, and computer algebra, and is the creator of the computer program Mathematica.

Contents

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 public school. Often described as a child prodigy, he published an article on particle physics at age 16[1] and entered Oxford University (St John's College) at age 17. He received his Ph.D. in particle physics from Caltech at age 20[2] and joined the faculty there. His work with Geoffrey Fox on the theory of the strong interaction is still used today in experimental particle physics.[3]

He 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.[4] 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 physical simulations (such as turbulent fluid flow) with cellular automata on the Connection Machine alongside Richard Feynman.[5]

Box cover art for Mathematica 6
Box cover art for Mathematica 6
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 extend the program and market it with success. As of today Stephen Wolfram is the majority shareholder.

A New Kind of Science
A New Kind of Science
Main article: A New Kind of Science

From 1992 to 2002, Wolfram 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.

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.

In the NKS book, Wolfram found the simplest known Universal Turing machine, the one with 2 states and 5 colors. Because it was known that no machine with 2 states and 2 colors can be universal, Wolfram afterwards made an empirical investigation of 2,985,984 possible 2,3 Turing machines and among candidates he selected one that he had intuition might indeed be the simplest universal Turing machine. A US$25,000 prize[6] 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 proved the universality of Wolfram's 2,3 Turing machine and was awarded the prize.[7] Computer scientist Vaughan Pratt later claimed to have found an error in the reasoning of the proof.[8] Wolfram Research and Alex Smith later disputed Pratt's claim on the same discussion group.[9][10][11]

  1. ^ Hadronic Electrons?. Note that the SPIRES date of April 1975 refers to the date the preprint was received, not the date of journal publication.
  2. ^ Thesis listing: Some Topics In Theoretical High-Energy Physics
  3. ^ See A Model for Parton Showers in QCD and Observables for the Analysis of Event Shapes in e+ e- Annihilation and Other Processes
  4. ^ Kolata, Gina. "Caltech Torn by Dispute Over Software," Science, 27 May 1983 (Vol. 220, No. 4600) issue, pgs. 932-934.
  5. ^ W. Daniel Hillis (1989-02). Richard Feynman and The Connection Machine. Physics Today. Retrieved on 3 November 2006.
  6. ^ The Prize Anouncement; Looking for the formal proof.
  7. ^ The Prize Is Won; The Simplest Universal Turing Machine Is Proved. The October 24 entry at Wolfram Research's blog announcing the news.
  8. ^ Argument against the proof claimed in the FOM list.
  9. ^ Stephen Wolfram reply in the FOM list.
  10. ^ Todd Rowland reply to Vaughan Pratt in the FOM list.
  11. ^ Alex Smith reply to Vaughan Pratt in the FOM list.

Persondata
NAME Wolfram, Stephen
ALTERNATIVE NAMES
SHORT DESCRIPTION British mathematician
DATE OF BIRTH August 29, 1959
PLACE OF BIRTH London, England, UK
DATE OF DEATH
PLACE OF DEATH
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.