Kenneth Appel

From Wikipedia, the free encyclopedia

Kenneth Appel (born 1932) is a mathematician who, in 1976 with colleague Wolfgang Haken at the University of Illinois at Urbana-Champaign, solved one of the most famous problems in mathematics, the four-color theorem. They proved that any two-dimensional map, with certain limitations, can be filled in with four colors without any adjacent "countries" sharing the same color. Appel's children, including Laurel Appel, Peter Appel, and Andrew Appel, now a professor at Princeton, helped in the checking of over 1000 topological cases that constitute this proof.

The proof has been one of the most controversial of modern mathematics because of its heavy dependence on computer "number-crunching" to sort through possibilities. Even Appel has agreed, in numerous interviews, that it lacks elegance and provided no new insight that has guided future mathematical research.

Others, however, have pointed to this work as the start of a sea-change in mathematicians' attitudes toward computers - which they had largely disdained as a tool for engineers rather than for theoreticians - leading to the creation of what is sometimes called "experimental mathematics."

From 1993 through 2002, Appel was head of the mathematics department at the University of New Hampshire in Durham, New Hampshire.

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.