Life, The Mind, and Everything

02/19/2016
by   Gary R. Prok, et al.
0

Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe. Incompleteness limits the ability of evolutionary processes from finding optimal solutions. Incompleteness limits the detectability of machine consciousness. This is an effort to convey these thoughts and results in a somewhat entertaining manner.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2011

Are Minds Computable?

This essay explores the limits of Turing machines concerning the modelin...
research
10/15/2021

When Combating Hype, Proceed with Caution

In an effort to avoid reinforcing widespread hype about the capabilities...
research
12/27/2019

The Epistemic Landscape: a Computability Perspective

By nature, transmissible human knowledge is enumerable: every sentence, ...
research
12/07/2021

Goedel's Incompleteness Theorem

I present the proof of Goedel's First Incompleteness theorem in an intui...
research
05/23/2023

Does ChatGPT have Theory of Mind?

“Theory of Mind" (ToM) is the ability to understand human thinking and d...
research
01/30/2019

Neuroevolution with Perceptron Turing Machines

We introduce the perceptron Turing machine and show how it can be used t...
research
04/20/2022

Tight limits and completions from Dedekind-MacNeille to Lambek-Isbell

While any infimum in a poset can also be computed as a supremum, and vic...

Please sign up or login with your details

Forgot password? Click here to reset