Godel, Escher, and Bach: An Eternal Golden Braid By Douglas Hofstadter Book Review By Grace Gilles CS110.

Slides:



Advertisements
Similar presentations
Summer 2011 Tuesday, 07/12. (Contemporary) Functionalist theories of consciousness Global workspace theory. The job description of consciousness is “global.
Advertisements

Copyright © Cengage Learning. All rights reserved.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 7: Beyond Classical Logic.
The MU Puzzle “Gödel, Escher, Bach – An Eternal Golden Braid” By Douglas Hofstadter “Gödel, Escher, Bach – An Eternal Golden Braid” By Douglas Hofstadter.
Elementary Number Theory and Methods of Proof
This is not the Title of our Seminar
1 Semantic Description of Programming languages. 2 Static versus Dynamic Semantics n Static Semantics represents legal forms of programs that cannot be.
Mathematics And The Axiomatic Method
12 VECTORS AND THE GEOMETRY OF SPACE.
The Axiomatic Method The 2004 Isuzu Axiom: Distinctive European Styling, now with Even More.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
Foundations of (Theoretical) Computer Science Chapter 1 Lecture Notes (more on Section 1.4) David Martin This work is licensed under.
Humans, Computers, and Computational Complexity J. Winters Brock Nathan Kaplan Jason Thompson.
Logical Agents Chapter 7. Why Do We Need Logic? Problem-solving agents were very inflexible: hard code every possible state. Search is almost always exponential.
Logic Puzzles Miran Kim Ben Seelbinder Matthew Sgambati.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
What computers just cannot do. COS 116: 2/28/2008 Sanjeev Arora.
Science Inquiry Minds-on Hands-on.
Introduction to Computer Science. A Quick Puzzle Well-Formed Formula  any formula that is structurally correct  may be meaningless Axiom  A statement.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
C OURSE : D ISCRETE STRUCTURE CODE : ICS 252 Lecturer: Shamiel Hashim 1 lecturer:Shamiel Hashim second semester Prepared by: amani Omer.
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Welcome to Honors Intro to CS Theory Introduction to CS Theory (Honors & Traditional): - formalization of computation - various models of computation (increasing.
About Math and related topics About Math 1. The Unreasonable Effectiveness The Unreasonable Effectiveness of Mathematics in the Natural Sciences by Eugene.
POSTULATES AND THEOREMS RELATING POINTS, LINES, AND PLANES 1.5.
1 10/13/2015 MATH 224 – Discrete Mathematics Why Study Discrete Math  Determination of the efficiency of algorithms, e.g., insertion sort versus selection.
CSC – 332 Data Structures Dr. Curry Guinn. Quick Info Dr. Curry Guinn –CIS 2045 – –
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
CONCEPTIONS OF COMPLEXITY AND IMPLICATIONS FOR ECONOMICS Stuart A. Umpleby The George Washington University Washington, DC.
1 Undecidability Reading: Chapter 8 & 9. 2 Decidability vs. Undecidability There are two types of TMs (based on halting): (Recursive) TMs that always.
Is the pq-system equivalent to addition? Is the pq-system isomorphic to addition of positive integers? AXIOMS: x p - q x - RULE: IF x p y q z THEN x p.
Welcome to Math 105 Gödel, Escher, and Bach. Question 1 What is the name of this song?
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.
1 L= { u u R where u  {a, b}* } Last class we designed a TM which accepts this language (that is, it halts if the input is in L and hangs or computes.
Functions Is Fibonacci Repeated or Recursive? Created by: Rachel Oakley.
MATH 224 – Discrete Mathematics
Meaning and Form in Mathematics Jan 30, 2001 Isomorphisms Induce Meaning Active vs. Passive Meaning Two-Part Invention.
1 Give the machine schema of a TM which when started like this: (q 0, #w[#]) for some string w in {a, b}* halts like this: (h, #001[#])
Introduction to Strings Intro to Computer Science CS1510, Section 2 Dr. Sarah Diesburg 1.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Inference: Probabilities and Distributions Feb , 2012.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
1 Announcements: There is no problem of the day today (handing in your assignment will be used to indicate attendance so please hand in a sheet with your.
1 M is a TM with start state s defined over the alphabet {#,(,),0,1,a,q,,}: NumStateHead 0hL 1sR 2t# 3( 4) a 8q 9, 2. Does M halt on input “M”?
CSC – 332 Data Structures Dr. Curry Guinn. Today Go over Homework 2 Godel, Escher, Bach.
Chapter 1: The cosmological argument AQA Religious Studies: Philosophy of Religion AS Level © Nelson Thornes Ltd 2008 Revision.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–10: Soundness of Propositional Calculus 12 th August, 2010.
1. What is Totality problem? 2. What is ji(x)?
Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.
Hubert Chan (Chapters 1.6, 1.7, 4.1)
What is Mathematics? The science (or art?) that deals with numbers, quantities, shapes, patterns and measurement An abstract symbolic communication system.
Agenda Preliminaries Motivation and Research questions Exploring GLL
CIS Automata and Formal Languages – Pei Wang
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Chapter 4 (Part 1): Induction & Recursion
CS344 : Introduction to Artificial Intelligence
Hubert Chan (Chapters 1.6, 1.7, 4.1)
Mathematical Induction Recursion
THE NATURE OF SCIENCE Essential Questions
KS2 Maths Meeting Thursday 28th September.
Lecture 22: Gödel’s Theorem CS200: Computer Science
Qualitative Observation
SPEECH110 C.ShoreFall 2015 East San Gabriel Valley, ROP
DISCRETE COMPUTATIONAL STRUCTURES
Cpt S 317: Spring 2009 Reading: Chapter 8 & 9
Lecture 23: Computability CS200: Computer Science
CIS Automata and Formal Languages – Pei Wang
Presentation transcript:

Godel, Escher, and Bach: An Eternal Golden Braid By Douglas Hofstadter Book Review By Grace Gilles CS110

Introduction Bach was known for using canons, or repetitions of a theme, which include things like rounds, and fugues, repetitions of a theme that are similar to canons, but less rigid, in his musical compositions. Escher was known for using paradoxes and illusions, including strange loops in his intellectually and mathematically stimulating graphic art. Godel used mathematical logic to explore mathematical reasoning itself. He looked at such problems as the paradoxical statement “This statement is a lie.”

Formal Systems: the MU puzzle Hofstadter talks a great deal about formal systems, which he explains using the MU puzzle. You begin with the string MI and manipulate it using these four rules, in order to get the string MU: – If your string ends with I, you can add U to the end. – If your string is Mx, you can also have Mxx. – If you have III, you can replace it with U. – If you have UU, you can drop it. Hofstadter discusses the differences between humans and computers in solving this problem: – Humans will automatically make observations, such as realizing that the string U is impossible to derive from MI, while computers require complex programming to make observations about problems – Humans can “jump out of the system” and use knowledge and reasoning outside of the system to help them solve a problem within the system, while computers cannot.

Formal Systems: the pq- System Another formal system that Hofstadter discusses is the pq- system, which uses the characters p, q, and -. – This system contains only one rule: suppose x, y, and z all stand for particular strings containing only hyphens. If xpyqz is a theorem then xpy-qz- is a theorem. – In order to be a theorem, the number of hyphens in the first two groups must add up the number of hyphens in the third group. Hofstadter uses this system to discuss isomorphism, such as that between the system and traditional addition, meaningful and meaningless interpretations of the system, and active vs. passive meanings.

Formal Systems: the tq- System With the tq- system, Hofstadter seeks to develop a system with the ability to distinguish between prime and composite numbers in its operation. The strings are of the form xtyqz, with x, y, and z being strings of X, Y, and Z number of hyphens, where X*Y=Z. – Hofstadter captures the idea of composite numbers with the rule, if x-ty-qz is a theorem, then Cz is a theorem. – However, the rule “if Cx is not a theorem then Px is a theorem,” cannot be used to find prime numbers, because it requires one to reason outside the system. Hofstadter uses the tq- system to discuss the figure and ground, or positive and negative space, idea, in both math/logic and music.

Zen in Godel and Escher’s Work In this chapter, Hofstadter ponders Zen, and its relation to the book’s title characters. He discusses the Zen master Mumon and his Mumonkan, which is comprised of 48 koans, each with an explanation and a poem, and how the work is riddled with paradoxes. He also compares Escher’s art to Mumon’s koans, because they are filled with logical paradoxes. Mumon’s logic solves the MU puzzle with this proof: – The I count begins at 1 (not a multiple of 3). – Two of the rules do not affect the I count. – The other two rules cannot influence the I count to contain a multiple of 3 if the original string does not contain a multiple of 3. – Therefore the I count cannot be a multiple of 3 and it is impossible to derive MU. He also discusses MIU producible numbers and using TNT to find producible numbers. He relates this to the Zen topic by showing that the TNT-Numbers are a recursively enumerable set.