Quine 1960 1966
   HOME
*





Quine 1960 1966
Quine may refer to: * Quine (surname), people with the surname ''Quine'' * Willard Van Orman Quine, the philosopher, or things named after him: ** Quine (computing), a program that produces its source code as output ** Quine–McCluskey algorithm, an algorithm used for logic minimization ** Quine's paradox, in logic ** Duhem–Quine thesis, in philosophy of science ** Quine–Putnam indispensability argument The Quine–Putnam indispensability argument is an argument in the philosophy of mathematics for the existence of abstract mathematical objects such as numbers and sets, a position known as mathematical platonism. It was named after the phil ...
, in philosophy of mathematics {{disambig ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Quine (surname)
Quine is a Manx surname. Notable people with the surname include: *Dan Quine (born 1967) British computer scientist *Don Quine (born 1938), American actor and writer, founder of Professional Karate Association *Edgar Quine (born 1934), Manx politician * John Quine (1857-1940), Manx clergyman, scholar and writer, ''The Captain of the Parish'' *Richard Quine (1920–1989), American actor and film director *Robert Quine (1942–2004), American guitarist *Willard Van Orman Quine (1908–2000), American analytic philosopher and logician * William Edward Quine (1847–1922), American physician and academic See also *Quinn (other) Quinn may refer to: People * Quinn (soccer) (born 1995), Canadian soccer player and Olympic gold medalist * Quinn (given name) * Quinn (surname) * Quinn (musician) Places in the United States * Quinn, Kentucky, an unincorporated community * ... {{surname, Quine Surnames Surnames of Manx origin ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Willard Van Orman Quine
Willard Van Orman Quine (; known to his friends as "Van"; June 25, 1908 – December 25, 2000) was an American philosopher and logician in the analytic tradition, recognized as "one of the most influential philosophers of the twentieth century". From 1930 until his death 70 years later, Quine was continually affiliated with Harvard University in one way or another, first as a student, then as a professor. He filled the Edgar Pierce Chair of Philosophy at Harvard from 1956 to 1978. Quine was a teacher of logic and set theory. Quine was famous for his position that first order logic is the only kind worthy of the name, and developed his own system of mathematics and set theory, known as New Foundations. In philosophy of mathematics, he and his Harvard colleague Hilary Putnam developed the Quine–Putnam indispensability argument, an argument for the reality of mathematical entities.Colyvan, Mark"Indispensability Arguments in the Philosophy of Mathematics" The Stanford Encyclopedi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Quine (computing)
A quine is a computer program which takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs". A quine is a fixed point of an execution environment, when the execution environment is viewed as a function transforming programs into their outputs. Quines are possible in any Turing-complete programming language, as a direct consequence of Kleene's recursion theorem. For amusement, programmers sometimes attempt to develop the shortest possible quine in any given programming language. The name "quine" was coined by Douglas Hofstadter, in his popular science book ''Gödel, Escher, Bach'', in honor of philosopher Willard Van Orman Quine (1908–2000), who made an extensive study of indirect self-reference, and in particular for the following paradox-producing expression, known as Q ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Quine–McCluskey Algorithm
The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants, is a method used for minimization of Boolean functions that was developed by Willard V. Quine in 1952 and extended by Edward J. McCluskey in 1956. As a general principle this approach had already been demonstrated by the logician Hugh McColl in 1878, was proved by Archie Blake in 1937, and was rediscovered by Edward W. Samson and Burton E. Mills in 1954 and by Raymond J. Nelson in 1955. Also in 1955, Paul W. Abrahams and John G. Nordahl as well as Albert A. Mullin and Wayne G. Kellner proposed a decimal variant of the method. The Quine–McCluskey algorithm is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and it also gives a deterministic way to check that the minimal form of a Boolean function has been reached. It is sometimes referred to as the tabulation method. The method involves two steps: # Finding all prime i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Quine's Paradox
Quine's paradox is a paradox concerning truth values, stated by Willard Van Orman Quine. It is related to the liar paradox as a problem, and it purports to show that a sentence can be paradoxical even if it is not self-referring and does not use demonstratives or indexicals (i.e. it does not explicitly refer to itself). The paradox can be expressed as follows: :"yields falsehood when preceded by its quotation" yields falsehood when preceded by its quotation. If the paradox is not clear, consider each part of the above description of the paradox incrementally: :it = ''yields falsehood when preceded by its quotation'' :its quotation = ''"yields falsehood when preceded by its quotation"'' :it preceded by its quotation = ''"yields falsehood when preceded by its quotation" yields falsehood when preceded by its quotation.'' With these tools, the description of the paradox may now be reconsidered; it can be seen to assert the following: :The statement "''yields falsehood when precede ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Duhem–Quine Thesis
The Duhem–Quine thesis, also called the Duhem–Quine problem, after Pierre Duhem and Willard Van Orman Quine, is that in science it is impossible to experimentally test a scientific hypothesis in isolation, because an empirical test of the hypothesis requires one or more background assumptions (also called ''auxiliary assumptions'' or ''auxiliary hypotheses''): the thesis says that unambiguous scientific falsifications are impossible.: "The physicist can never subject an isolated hypothesis to experimental test, but only a whole group of hypotheses" (Duhem)... "Duhem denies that unambiguous falsification procedures do exist in science." In recent decades the set of associated assumptions supporting a thesis sometimes is called a ''bundle of hypotheses''. Although a bundle of hypotheses (i.e. a hypothesis and its background assumptions) ''as a whole'' can be tested against the empirical world and be falsified if it fails the test, the Duhem–Quine thesis says it is impossible ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]