HOME

TheInfoList



OR:

In
philosophy Philosophy (from , ) is the systematized study of general and fundamental questions, such as those about existence, reason, knowledge, values, mind, and language. Such questions are often posed as problems to be studied or resolved. Some ...
, unknowability is the possibility of inherently unaccessible knowledge. It addresses the epistemology of that which we ''cannot'' know. Some related concepts include the halting problem, the limits of knowledge, the unknown unknowns, and chaos theory. Nicholas Rescher provides the most recent focused scholarship for this area in ''Unknowability: An Inquiry into the Limits of Knowledge'', where he offered three high level categories, logical unknowability, conceptual unknowability, and in-principle unknowability.


Background

Speculation about what is knowable and unknowable has been part of the philosophical tradition since the inception of philosophy. In particular,
Baruch Spinoza Baruch (de) Spinoza (born Bento de Espinosa; later as an author and a correspondent ''Benedictus de Spinoza'', anglicized to ''Benedict de Spinoza''; 24 November 1632 – 21 February 1677) was a Dutch philosopher of Portuguese-Jewish origin, b ...
's Theory of Attributes argues that a human's finite mind cannot understand infinite substance; accordingly, infinite substance, as it is in itself, is in-principle unknowable to the finite mind. Immanuel Kant brought focus to unknowability theory in his use of the noumenon concept. He postulated that, while we can know the noumenal exists, it is not itself sensible and must therefore remain unknowable. Modern inquiry encompasses undecidable problems and questions such as the halting problem, which in their very nature cannot be possibly answered. This area of study has a long and somewhat diffuse history as the challenge arises in many areas of scholarly and practical investigations.


Rescher's categories of unknowability

Rescher organizes unknowability in three major categories: * logical unknowability — arising from abstract considerations of epistemic logic. * conceptual unknowability — analytically demonstrable of unknowability based on concepts and involved. * in-principle unknowability — based on fundamental principles. In-principle unknowability may also be due to a need for more energy and matter than is available in the universe to answer a question, or due to fundamental reasons associated with the quantum nature of matter. In the physics of special and general relativity, the light cone marks the boundary of physically knowable events.


The halting problem

The halting problem – namely, the problem of determining if arbitrary computer programs will ever finish running – is a prominent example of an unknowability associated with the established mathematical field of
computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since e ...
. In 1936, Alan Turing proved that the halting problem is undecidable. This means that there is no algorithm that can take as input a program and determine whether it will halt. In 1970,
Yuri Matiyasevich Yuri Vladimirovich Matiyasevich, (russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's t ...
proved that the Diophantine problem (closely related to
Hilbert's tenth problem Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge to provide a general algorithm which, for any given Diophantine equation (a polynomial equat ...
) is also undecidable by reducing it to the halting problem. This means that there is no algorithm that can take as input a Diophantine equation and determine whether it has a solution in integers. The undecidability of the halting problem and the Diophantine problem has a number of implications for mathematics and computer science. For example, it means that there is no general algorithm for proving that a given mathematical statement is true or false. It also means that there is no general algorithm for finding solutions to Diophantine equations. In principle, many problems can be reduced to the halting problem. See the
list of undecidable problems In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any computer program that always gives the correct answer; that is, any possible program would some ...
.
Gödel's incompleteness theorems Gödel's incompleteness theorems are two theorems of mathematical logic Mathematical logic is the study of logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory. Research i ...
demonstrate the implicit in-principle unknowability of methods to prove consistency and completeness of foundation mathematical systems.


Related concepts

There are various graduations of unknowability associated with frameworks of discussion. For example: * unknowability to particular individual humans (due to individual limitations); * unknowability to humans at a particular time (due to lack of appropriate tools); * unknowability to humans due to limits of matter and energy in the universe that might be required to conduct the appropriate experiments or conduct the calculations required; * unknowability to any processes, organism, or artifact. Treatment of knowledge has been wide and diverse. Wikipedia itself is an initiate to capture and record knowledge using contemporary technological tools. Earlier attempts to capture and record knowledge include writing deep tracts on specific topics as well as the use of
encyclopedias An encyclopedia (American English) or encyclopædia (British English) is a reference work or compendium providing summaries of knowledge either general or special to a particular field or discipline. Encyclopedias are divided into articles ...
to organize and summarize entire fields or event the entirety of human knowledge.


Limits of knowledge

An associated topic that comes up frequently is that of Limits of Knowledge. Examples of scholarly discussions involving ''limits of knowledge'' include: * John Horgan's ''End of science: facing the limits of knowledge in the twilight of the scientific age''. * Tavel Morton's ''Contemporary physics and the limits of knowledge''. * Christopher Cherniak's ''Limits for knowledge''. * Ignoramus et ignorabimus, a Latin maxim meaning "we do not know and will not know", popularized by Emil du Bois-Reymond. Bois-Reymond's ''ignorabimus'' proclamation was viewed by
David Hilbert David Hilbert (; ; 23 January 1862 – 14 February 1943) was a German mathematician, one of the most influential mathematicians of the 19th and early 20th centuries. Hilbert discovered and developed a broad range of fundamental ideas in many a ...
as unsatisfactory, and motivated Hilbert to declare in 1900
International Congress of Mathematicians The International Congress of Mathematicians (ICM) is the largest conference for the topic of mathematics. It meets once every four years, hosted by the International Mathematical Union (IMU). The Fields Medals, the Nevanlinna Prize (to be rename ...
that answers to problems of mathematics are possible with human effort. He declared, "in mathematics there is no ",. The halting problem and the Diophantine Problem eventually were answered demonstrating in-principle unknowability of answers to some foundational mathematical questions, meaning Bois-Reymond's assertion was in fact correct. Gregory Chaitin discusses unknowability in many of his works.


Categories of unknowns

Popular discussion of unknowability grew with the use of the phrase There are unknown unknowns by United States Secretary of Defense
Donald Rumsfeld Donald Henry Rumsfeld (July 9, 1932 – June 29, 2021) was an American politician, government official and businessman who served as Secretary of Defense from 1975 to 1977 under president Gerald Ford, and again from 2001 to 2006 under Presi ...
at a news briefing on February 12, 2002. In addition to unknown unknowns there are known unknowns and unknown knowns. These category labels appeared in discussion of identification of chemical substances.


Chaos theory

Chaos theory Chaos theory is an interdisciplinary area of scientific study and branch of mathematics focused on underlying patterns and deterministic laws of dynamical systems that are highly sensitive to initial conditions, and were once thought to have co ...
is a theory of dynamics that argues that, for sufficiently complex systems, even if we know initial conditions fairly well, measurement errors and computational limitations render fully correct long-term prediction impossible, hence guaranteeing ultimate unknowability of physical system behaviors.


References

{{Reflist


Further reading

* Chaitin, Gregory J. The unknowable. Springer Science & Business Media, 1999. https://www.worldcat.org/title/41273107 * DeNicola, Daniel R. Understanding ignorance: The surprising impact of what we don't know. MIT Press, 2017 * https://www.worldcat.org/search?q=ti%3A%22limits+of+knowledge%22 Concepts in epistemology Knowledge