The Epistemic Landscape: a Computability Perspective

12/27/2019
by   Frederic Prost, et al.
0

By nature, transmissible human knowledge is enumerable: every sentence, movie, audio record can be encoded in a sufficiently long string of 0's and 1's. The works of Gödel, Turing and others showed that there are inherent limits and properties associated with the fact that language technology is enumerable. Gödel's numbering technique is universal for enumerable structures and shows strong limits of the language technology. Computability theory is a particular example: programs can be numbered and all sorts of limits can be studied from there. Computability is also at the heart of science since any experimental validation of a theory supposes that theoretical results have been computed, then checked against concrete experiments. It implies that limitations on what is computable ultimately are also limits of what we understand as "scientific theory", and more generally to all the transmissible knowledge. We argue that it is fruitful to look a epistemology from a computability perspective. We show that it allows to precisely define different kinds of knowledge acquisition techniques, and helps the study of how they are related to one another.

READ FULL TEXT
research
10/13/2011

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modelin...
research
05/04/2010

Informal Concepts in Machines

This paper constructively proves the existence of an effective procedure...
research
02/19/2016

Life, The Mind, and Everything

Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Infor...
research
09/09/2019

Logical Quantum Field Theory

We consider the statistical mechanical ensemble of bit string histories ...
research
07/09/2019

A duality theoretic view on limits of finite structures

The study of limits of sequences of finite structures plays a crucial ro...
research
07/17/2017

The Limits to Machine Consciousness

It is generally accepted that machines can replicate cognitive tasks per...
research
07/04/2016

Superintelligence cannot be contained: Lessons from Computability Theory

Superintelligence is a hypothetical agent that possesses intelligence fa...

Please sign up or login with your details

Forgot password? Click here to reset