Search results
Results from the WOW.Com Content Network
William Lowell Putnam Mathematical Competition results; William Lowell Putnam Competition problems, solutions, and results archive; Archive of Problems 1938–2003; Searchable data base for information about careers of Putnam Fellows; A comprehensive history of the Putnam competition An electronic update of Gallian's 2004 paper (PDF)
The Twin Earth thought experiment was one of three examples that Putnam offered in support of semantic externalism, the other two being what he called the Aluminum-Molybdenum case and the Beech-Elm case. Since the publication of these cases, numerous variations on the thought experiment have been proposed by philosophers.
The task of proving that R(3, 3) ≤ 6 was one of the problems of William Lowell Putnam Mathematical Competition in 1953, as well as in the Hungarian Math Olympiad in 1947. A multicolour example: R (3, 3, 3) = 17
Many of Putnam's last works addressed the concerns of ordinary people, particularly social problems. [104] For example, he wrote about the nature of democracy, social justice and religion. He also discussed Jürgen Habermas's ideas, and wrote articles influenced by continental philosophy. [23]
Championnat International de Jeux Mathématiques et Logiques — for all ages, mainly for French-speaking countries, but participation is not limited by language.; China Girls Mathematical Olympiad (CGMO) — held annually for teams of girls representing different regions within China and a few other countries.
The Putnam Fellows are the top 5 (or 6 in event of a tie) in the annual William Lowell Putnam Mathematical Competition. Pages in category "Putnam Fellows" The following 89 pages are in this category, out of 89 total.
Sounds fine to me. Perhaps the main article can list the most recent winners (team and individual) and provide an internal link to the list, as you say. I would think your best bet is to separate the two -- Putnam, Putnam/Fellows, Putnam/Top Scoring Teams. Rjyanco 19:03, 12 May 2004 (UTC)
In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem.