When things become undecidably complex. Within linear, one- dimensional thinking.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Complexity. P=NP? Who knows? Who cares? Lets revisit some questions from last time – How many pairwise comparisons do I need to do to check if a sequence.
The Ultimate Proof That God Exists.
Anselm On the Existence of God. “Nor do I seek to understand so that I can believe, but rather I believe so that I can understand. For I believe this.
Puzzles and Paradoxes of Time Travel. Quiz Answer ONE of the following: 1) Should Andrew be considered a person? 2) Does Andrew have free will? 3) Do.
Incremental Linear Programming Linear programming involves finding a solution to the constraints, one that maximizes the given linear function of variables.
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
Hard problems November Administrivia Ps 8 –Handed out Tuesday (12/4) –Due Tuesday (12/11) or Tuesday (12/18) your choice Ps 9 –Handed out Thursday.
The Halting Problem of Turing Machines. Is there a procedure that takes as input a program and the input to that program, and the procedure determines.
Kant’s Ethical Theory.
Copyright © Cengage Learning. All rights reserved.
Gödel’s Incompletness Theorem By Njegos Nincic. Overview  Set theory: Background, History Naïve Set Theory  Axiomatic Set Theory  Icompleteness Theorem.
Limitations. Limitations of Computation Hardware precision Hardware precision Software - we’re human Software - we’re human Problems Problems –complex.
STRUCTURAL PROOF THEORY: Uncovering capacities of the mathematical mind Wilfried Sieg Carnegie Mellon.
Ben Gerke. Lived French existentialist philosopher, influenced by Kant, Hegel, and Kierkegaard, among others Father Jean-Baptiste Sartre was.
Allah and the Big Bang Theory. Standard Big-Bang Cosmology  The universe, including all of time, space and matter, began to exist in a cataclysmic event.
Introduction to Ethics Lecture 8 Moore’s Non-naturalism
Argument from contingency Part 2. Recap  Necessary beings: exist as a necessity of their own nature. (Potential examples: numbers, God.)  Contingent.
Additional Thoughts. Competing ideas != competing truths –The theories regard the truth but are not the truth itself –Truths, by definition cannot compete.
INTRODUCTION TO CRITICAL THINKING. “There are multiple decisions which you have to make entirely by yourself. You can’t lean on anybody else. And a good.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Logic and Set Theory.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
Logic and Proof. Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement.
CSE115/ENGR160 Discrete Mathematics 03/03/11 Ming-Hsuan Yang UC Merced 1.
Lecture 24: Gödel’s Proof CS150: Computer Science
The Turing Machine What Is Turing Machine? It is a conceptual machine put forward by Allan Turing in It is composed of –A unlimitedly long tape.
Some stupid remarks by smart people If it should turn out that the basic logics of a machine designed for the numerical solution of differential equations.
Index FAQ Limits of Sequences of Real Numbers Sequences of Real Numbers Limits through Rigorous Definitions The Squeeze Theorem Using the Squeeze Theorem.
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
A Defense of Utilitarianism
Philosophy 1050: Introduction to Philosophy Week 10: Descartes and the Subject: The way of Ideas.
Chapter 10 Evaluating Premises: Self-Evidence, Consistency, Indirect Proof Invitation to Critical Thinking First Canadian.
On Denoting and its history Harm Boukema. Everyone agrees that “the golden mountain does not exist” is a true proposition. But it has, apparently, a subject,
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
Course Overview and Road Map Computability and Logic.
What Is Literature? Reading, Assessing, Analyzing.
Puzzles and Paradoxes of Time Travel
The Turn to the Science The problem with substance dualism is that, given what we know about how the world works, it is hard to take it seriously as a.
Great Theoretical Ideas in Computer Science.
Godel’s proof Danny Brown. Outline of godel’s proof 1.Create a statement that says of itself that it is not provable 2.Show that this statement is provable.
LECTURE 19 THE COSMOLOGICAL ARGUMENT CONTINUED. THE QUANTUM MECHANICAL OBJECTION DEPENDS UPON A PARTICULAR INTERPRETATION WE MIGHT REASONABLY SUSPEND.
KANT Kant was looking for some sort of objective basis for morality – a way of knowing our duty.
Class 6 Kant. Immanuel Kant (1724–1804) From Königsberg, Germany.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and Logic.
Friday 8 Sept 2006Math 3621 Axiomatic Systems Also called Axiom Systems.
Anselm’s “1st” ontological argument Something than which nothing greater can be thought of cannot exist only as an idea in the mind because, in addition.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. FOUNDATIONS.
Fundamentals of Informatics Lecture 12 The Halting Problem Bas Luttik.
Overview of the theory of computation Episode 3 0 Turing machines The traditional concepts of computability, decidability and recursive enumerability.
Introduction  Based on something other than the consequences of a person’s actions  Unlike Egoism  People should act in their own self-interest  Unlike.
PHILOSOPHY OF LANGUAGE Some topics and historical issues of the 20 th century.
 Gödel: ‘How did you receive your revolutionary insights?’  Einstein: ‘By raising questions that children are told not to ask’.
Mere Christianity C. S. Lewis. The Law of Human Nature Chapter 1 Two basic points: –Human beings, all over the earth, have this curious idea that they.
Copyright 1999Paul F. Reynolds, Jr. Foundations of Logic Programming.
MNU Five Other Ethical Systems Dr. Judy Martin Session 7 – February 18, 2014.
Existentialism and The Meaning of Life
Chapter 1 Logic and Proof.
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Mathematics and Knowledge
Reasoning about Reasoning
Lecture 22: Gödel’s Theorem CS200: Computer Science
Class 24: Computability Halting Problems Hockey Team Logo
Properties of Relational Logic
Lecture 23: Computability CS200: Computer Science
Presentation transcript:

When things become undecidably complex

Within linear, one- dimensional thinking.

1. A is A Law of Identity Law of Identity 2. A must be either A or not A Law of Contradiction Law of Contradiction 3. A cannot be both A and not A Law of Excluded Middle Law of Excluded Middle

But what if we have n- dimensional thinking along n-lines? But what if we have n- dimensional thinking along n-lines?

0-Dimension

1-Dimension

2-Dimensions

3-Dimensions

4-dimensions

From ‘I’ (a point: 0-D {nothingness, emptiness}) to ‘Other’ (a line: 1-D {linearity, bivalence}) to ‘I  Other’ (a plane: 2-D {possibly 3-valued}) to ‘Community’ (a cube: 3-D {many-valued}) to ‘Cosmos’ (a hypercube: 4:D {potentially  -valued})

Of, if you wish, a 4-D Tessaract

Now…

In other words, there is no absolute priority, and everything is possible, given fluctuating times and places and conditions. In other words, there is no absolute priority, and everything is possible, given fluctuating times and places and conditions.

Or, consider a sort of Gödel’s proof, from a concrete, practical point of view…

Gödel first thought that his theorems established the superiority of mind over machine. Gödel first thought that his theorems established the superiority of mind over machine.

Later, he came to a less decisive, conditional view: if machine can equal mind, the fact that it does cannot be proved. Later, he came to a less decisive, conditional view: if machine can equal mind, the fact that it does cannot be proved.

This view parallels the logical form of Gödel’s second theorem: if a formal system of a certain kind is consistent, the fact that it is cannot be proved within the system. This view parallels the logical form of Gödel’s second theorem: if a formal system of a certain kind is consistent, the fact that it is cannot be proved within the system.

Gödel’s more famous first theorem says that if a formal system (or a certain kind) is consistent, a specific sentence of the system cannot be proved within it. Gödel’s more famous first theorem says that if a formal system (or a certain kind) is consistent, a specific sentence of the system cannot be proved within it.

Extrapolating from the above, in everyday situations, if our knowing becomes inconsistent (flawed, unacceptable), then we go on to choose between all the possibilities that may present themselves, and we proceed to articulate the consequences of our choice at some particular time and place within some particular context. Extrapolating from the above, in everyday situations, if our knowing becomes inconsistent (flawed, unacceptable), then we go on to choose between all the possibilities that may present themselves, and we proceed to articulate the consequences of our choice at some particular time and place within some particular context.

But then we can’t know if this choice will prove consistent at/in any and all times, places, and contexts, for if it is indeed consistent, nevertheless, there is no knowing whether at some other time, place, and context it will not reveal an inconsistency. But then we can’t know if this choice will prove consistent at/in any and all times, places, and contexts, for if it is indeed consistent, nevertheless, there is no knowing whether at some other time, place, and context it will not reveal an inconsistency.

Thus whatever choices we make from the range of all possibilities will be incomplete, for there is no way to know that they will not be subject to some inconsistency or another at some particular time and place and within some particular context. Thus whatever choices we make from the range of all possibilities will be incomplete, for there is no way to know that they will not be subject to some inconsistency or another at some particular time and place and within some particular context.

Stated otherwise… Stated otherwise…

What good is rigorous formalization that can prove a sentence which says that it is not provable (first theorem)? What good is rigorous formalization that can prove a sentence which says that it is not provable (first theorem)?And, What good is such formalization that can prove its consistency when it would follow that it is not consistent (second theorem)? What good is such formalization that can prove its consistency when it would follow that it is not consistent (second theorem)?

Or, in everyday life situations… Or, in everyday life situations…

What good is knowing, if it can know a sentence within itself revealing that it is not knowable (much like Gödel’s first theorem)? What good is knowing, if it can know a sentence within itself revealing that it is not knowable (much like Gödel’s first theorem)? What good is knowing that claims to know its own consistency when it follows that that knowing is inconsistent (much like Gödel’s second theorem)? What good is knowing that claims to know its own consistency when it follows that that knowing is inconsistent (much like Gödel’s second theorem)?

Knowing is either inconsistent or incomplete, or in the worst of all possible worlds, both. Knowing is either inconsistent or incomplete, or in the worst of all possible worlds, both.

That is to say: We never know entirely what we mean by what we say or write, or the implications of our interpretation regarding what somebody else says or writes. Nonetheless, we will undoubtedly continue on, in learned ignorance, blissfully saying and writing and listening and reading. That is to say: We never know entirely what we mean by what we say or write, or the implications of our interpretation regarding what somebody else says or writes. Nonetheless, we will undoubtedly continue on, in learned ignorance, blissfully saying and writing and listening and reading.

For, concrete everyday living knows of no carved in stone linearity: it thrives on far-from- equilibrium conditions, which allow it always to be in the process of becoming something other than what it was becoming

‘Indeed,… I predict a time when threre will be mathematican investigations of calculi containing contradictions, and people will actually be proud of having emancipated themselves from consistency’ (Ludwig Wittgenstein, Philosophical Remarks, Blackwell, 1964, p. 332).