Silly Questions, Infinity, and Other Things Farhad Arbab Center for Mathematics and Computer Science (CWI), Amsterdam and Leiden Institute for Advanced.

Slides:



Advertisements
Similar presentations
Cantor’s Infinities Raymond Flood Gresham Professor of Geometry.
Advertisements

Copyright © Cengage Learning. All rights reserved.
1 The Limits of Computation Intractable and Non-computable functions.
Limitations. Limitations of Computation Hardware precision Hardware precision Software - we’re human Software - we’re human Problems Problems –complex.
1 COMP 382: Reasoning about algorithms Unit 9: Undecidability [Slides adapted from Amos Israeli’s]
Week 7 - Wednesday.  What did we talk about last time?  Set proofs and disproofs  Russell’s paradox.
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
Introduction to Computability Theory
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
CS1001 Lecture 22. Overview Mechanizing Reasoning Mechanizing Reasoning G ö del ’ s Incompleteness Theorem G ö del ’ s Incompleteness Theorem.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
CHAPTER 4 Decidability Contents Decidable Languages
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Lecture ,3.3 Sequences & Summations Proof by Induction.
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
Computability Thank you for staying close to me!! Learning and thinking More algorithms... computability.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
Cantor’s Legacy: Infinity And Diagonalization Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 25Apr 13, 2004Carnegie.
Class 36: Proofs about Unprovability David Evans University of Virginia cs1120.
Implications of Cantorian Transfinite Set Theory on Creation.
1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright.
David Evans CS200: Computer Science University of Virginia Computer Science Class 24: Gödel’s Theorem.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Institute for Experimental Physics University of Vienna Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences Undecidability.
1 Undecidability Reading: Chapter 8 & 9. 2 Decidability vs. Undecidability There are two types of TMs (based on halting): (Recursive) TMs that always.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
Great Theoretical Ideas in Computer Science for Some.
Cantor and Countability: A look at measuring infinities How BIG is big? = a Googol 10 googol = a Googolplex = one Tremilliomilliotrecentrecentre.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Lecture 18. Unsolvability Before the 1930’s, mathematics was not like today. Then people believed that “everything true must be provable”. (More formally,
CS 345: Chapter 8 Noncomputability and Undecidability Or Sometimes You Can’t Get It Done At All.
Course Overview and Road Map Computability and Logic.
Ch. 11: Cantor’s Infinity!. N = {1, 2, 3, 4, 5, 6, …} “the natural numbers” Z = {…, –3, –2, –1, 0, 1, 2, 3, …} “the integers” Q = {all quotients “a/b”
A Universal Turing Machine
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas in Computer Science.
INFIINITE SETS CSC 172 SPRING 2002 LECTURE 23. Cardinality and Counting The cardinality of a set is the number of elements in the set Two sets are equipotent.
Thinking in Methodologies Class Notes. Gödel’s Theorem.
Artificial Intelligence “Introduction to Formal Logic” Jennifer J. Burg Department of Mathematics and Computer Science.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Complexity & Computability. Limitations of computer science  Major reasons useful calculations cannot be done:  execution time of program is too long.
Computation Motivating questions: What does “computation” mean? What are the similarities and differences between computation in computers and in natural.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
Fundamentals of Informatics Lecture 12 The Halting Problem Bas Luttik.
CSE 311: Foundations of Computing Fall 2014 Lecture 27: Cardinality.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
On computable numbers, with an application to the ENTSCHEIDUNGSPROBLEM COT 6421 Paresh Gupta by Alan Mathison Turing.
Week 7 - Wednesday.  What did we talk about last time?  Proving the subset relationship  Proving set equality  Set counterexamples  Laws of set algebra.
The Church-Turing Thesis Chapter Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve:
1 A Universal Turing Machine. 2 Turing Machines are “hardwired” they execute only one program A limitation of Turing Machines: Real Computers are re-programmable.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Raymond Flood Gresham Professor of Geometry
The Acceptance Problem for TMs
CIS Automata and Formal Languages – Pei Wang
Axiomatic Number Theory and Gödel’s Incompleteness Theorems
Computable Functions.
Discrete Mathematics for Computer Science
CSE 311 Foundations of Computing I
Great Theoretical Ideas in Computer Science
Lecture 22: Gödel’s Theorem CS200: Computer Science
Discrete Math for CS CMPSC 360 LECTURE 43 Last time: Variance
Formal Languages, Automata and Models of Computation
Great Theoretical Ideas in Computer Science
CIS Automata and Formal Languages – Pei Wang
Presentation transcript:

Silly Questions, Infinity, and Other Things Farhad Arbab Center for Mathematics and Computer Science (CWI), Amsterdam and Leiden Institute for Advanced Computer Science (LIACS), Leiden University The Netherlands 23 January 2010

Stupidity  Stupidity o1 : the quality or state of being stupidstupid o2 : a stupid idea or actstupid  Stupid oEtymology: Middle French stupide, from Latin stupidus, from stupēre to be numb, be astonished o1:  a: slow of mind : obtuseobtuse  b: given to unintelligent decisions or acts : acting in an unintelligent or careless manner  c: lacking intelligence or reason : brutishbrutish o2: dulled in feeling or sensation : torpid torpid o3: marked by or resulting from unreasoned thinking or acting : senseless senseless o4:  a: lacking interest or point  b: vexatious, exasperating vexatiousexasperating © F. Arbab Silly Questions, Infinity, & Other Things

Abundance of Stupidity  Only two things are infinite: the universe and human stupidity; and I'm not sure about the universe. –Albert Einstein  Never attribute to malice that which can be adequately explained by stupidity.  Any sufficiently advanced incompetence is indistinguishable from malice. © F. Arbab Silly Questions, Infinity, & Other Things

Aspects of Stupidity  Being stupid  Acting stupid  Feeling stupid © F. Arbab Silly Questions, Infinity, & Other Things

Being Stupid  Humans are not inherently stupid!  Inherently stupid individuals are statistically rare. © F. Arbab Silly Questions, Infinity, & Other Things

Acting Stupid  One does not have to be stupid to commit stupid acts!  Result of insufficient information and/or inadequately slow, unintelligent, careless, unfeeling, pointless, unreasoned thinking. oReality oPerception  Often, something interferes with, disrupts, or blocks our inherent intelligence and rational thinking. oNew external distress oInternalized distress  Most people are trained and conditioned to behave based on unreasoned or unintelligent thinking. © F. Arbab Silly Questions, Infinity, & Other Things

Feeling stupid  Feelings are there to be felt, not to determine our courses of action.  Get used to feeling stupid oCommit harmless acts of stupidity  It only feels bad, it is not the reality oyou are not stupid, even if you committed a stupid act!  Seek, marvel at, and ponder what makes you feel stupid oIn spite of your feeling, commit rational acts that only look and feel stupid © F. Arbab Silly Questions, Infinity, & Other Things

Stupidity is the Motor of Science  If people never did silly things, nothing intelligent would ever happen. –Ludwig J.J. Wittgenstein  He who thinks great thoughts, errs greatly. –Martin Heidegger  The importance of stupidity in scientific research, Martin Schwartz, J Cell Sci. 2008; 121:1771. © F. Arbab Silly Questions, Infinity, & Other Things

Homework  Find a copy of this paper and read it: oThe importance of stupidity in scientific research, Martin Schwartz, J Cell Sci. 2008; 121:1771  Write an essay containing: oCritical summary of the above paper oComparison with  your ideas on the subject  what you learn from this presentation  Write your name on a separate sheet oDouble blind review process © F. Arbab Silly Questions, Infinity, & Other Things

Ignorance  Ignorance oThe state or fact of being ignorant : lack of knowledge, education, or awarenessignorant  ignorant o1:  a: destitute of knowledge or education; also : lacking knowledge or comprehension of the thing specified  b: resulting from or showing lack of knowledge or intelligence o2: unaware, uninformedunawareuninformed © F. Arbab Silly Questions, Infinity, & Other Things

Forms of Ignorance  Ignorance is bliss  What you do not know cannot hurt you. oBut you have to be lucky to qualify!  Unaware ignorance  Aware ignorance  Deliberate ignorance oDeluding oneself oIgnoring the irrelevant: Abstraction  basis for mathematics! © F. Arbab Silly Questions, Infinity, & Other Things

Abstraction  Abstraction is a cognitive means to overcome complexity oFocus on essential features and suppress/ignore the rest. oA many-to-one mapping © F. Arbab Silly Questions, Infinity, & Other Things

Numbers  The first major advance in abstraction was the concept of numbers oCorrespondence between elements of sets  The second was the use of numerals to represent numbers oEgyptians had a powerful system with hieroglyphs for 1 to 10. oBabylonians had a place value system. © F. Arbab 2010 Silly Questions, Infinity, & Other Things13

The Concept of Number  Consider a set of men and a set of beads.  If each man has a single bead and each bead belongs to a single man, we have a one-to-one correspondence between (the elements of) these two sets.  All sets that have such a one-to-one correspondence with these sets have the same size.  A number is an abstraction of all these sets, ignoring all of their properties except their common size.  Numerals are symbols that represent numbers oWe commonly use the base-10 place-value system © F. Arbab 2010 Silly Questions, Infinity, & Other Things14

Natural Numbers  Historically: o1, 2, 3, 4, …  Since late 19 th century: o0, 1, 2, 3, …  Counting is establishing a one-to-one correspondence between (the elements of) a set and (the elements of the set of) natural numbers. © F. Arbab 2010 Silly Questions, Infinity, & Other Things15

Puzzle  10 bags of identical looking gold coins  Every coin in 9 bags weighs 100 grams  Every coin in one bag weighs 90 grams  Determine which bag contains defective coins using a single scale only once. © F. Arbab 2010 Silly Questions, Infinity, & Other Things16

Arithmetic  Natural numbers have been used in arithmetic for millennia,  Until 19 th century, it was not clear why some of the properties of arithmetic and natural numbers hold. © F. Arbab 2010 Silly Questions, Infinity, & Other Things17

Giuseppe Peano © F. Arbab 2010 Silly Questions, Infinity, & Other Things18 Born: 27 August 1858 Spinetta, Piedmont, ItalySpinettaPiedmontItaly Died: 20 April 1932 (aged 73)

Peano Axioms  Giuseppe Peano formal theory of the natural numbers: oThere is a natural number 0. oEvery natural number a has a natural number successor, denoted by S(a). Intuitively, S(a) is a+1. oThere is no natural number whose successor is 0. oDistinct natural numbers have distinct successors: if a ≠ b, then S(a) ≠ S(b). oIf a property is possessed by 0 and also by the successor of every natural number which possesses it, then it is possessed by all natural numbers. (This postulate ensures that the proof technique of mathematical induction is valid.)mathematical induction © F. Arbab 2010 Silly Questions, Infinity, & Other Things19

Infinity  How large is the set of natural numbers?  How large are other sets? oSubsets of natural numbers oSet of all integers oSets of subsets of natural numbers or integers oSet of real numbers oEtc.  Is infinity itself a number? oCan we use it in place of a number in arithmetic?  Are all infinite sets the same size? © F. Arbab 2010 Silly Questions, Infinity, & Other Things20

Georg Ferdinand Ludwig Phillip Cantor  Born: March 3, 1845 Saint Petersburg, Russia Saint PetersburgRussia  Died: January 6, 1918 (aged 72) Halle, Germany HalleGermany  Creator of set theory  Importance of one-to-one correspondence  Defined infinite sets oShowed their seemingly paradoxical properties  Different orders of infinity (cardinality) oIntegers are countably infinite, but real numbers are uncountably infinite © F. Arbab 2010 Silly Questions, Infinity, & Other Things21

Properties of Infinity  How large is the set of natural numbers starting with 0?  How large is the set of natural numbers starting with 1?  How large is the set of natural numbers starting with 10?  How large is the set of odd natural numbers?  How large is the set of even natural numbers?  How large is the set of integers? © F. Arbab 2010 Silly Questions, Infinity, & Other Things22

Infinity of Real Numbers  How many real numbers are there between, say 0 and 1? © F. Arbab 2010 Silly Questions, Infinity, & Other Things23

Puzzles  Muddy children 1  Muddy children 2 © F. Arbab 2010 Silly Questions, Infinity, & Other Things24

A Rock Too Big to Lift!  Can mathematics devise ways to answer any question we can express in the language of logic?  In early 20 th century, mathematicians believed the answer was yes! © F. Arbab 2010 Silly Questions, Infinity, & Other Things25

David Hilbert  Born: January 23, 1862 Königsberg or Wehlau, Province of Prussia KönigsbergWehlauProvince of Prussia  Died: February 14, 1943 (aged 81) Göttingen, Germany GöttingenGermany  Proposed in 1920 his program for mathematics: oFormulate all of mathematics on a solid and complete logical foundation oHe believed this was possible in principle by  Choosing a correct finite set of axioms  Proving that the axioms are consistent © F. Arbab 2010 Silly Questions, Infinity, & Other Things26

Kurt Gödel  Born: April 28, 1906 Brno, Moravia, Austria-Hungary BrnoMoraviaAustria-Hungary  Died: January 14, 1978 (aged 71) Princeton, New Jersey, U.S. Princeton, New JerseyU.S.  In 1931 demonstrated that any non- contradictory formal system, comprehensive enough to include at least arithmetic, cannot demonstrate its completeness by way of its own axioms.  There are true statements that cannot be derived from the (finite) axioms of the system.  Hilbert's grand plan was impossible! © F. Arbab 2010 Silly Questions, Infinity, & Other Things27

Problems and Solutions  In its simplest form, a problem is a question about some input, that has a yes/no answer: oGiven the numbers x and y is x the square root of y? oGiven an integer x, is x an even number?  The solution to a problem is an algorithm that is guaranteed to terminate in finite time and provides the proper yes/no answer.  A problem for which a solution exists is called decidable.  Are all problems decidable? © F. Arbab 2010 Silly Questions, Infinity, & Other Things28

Termination of Programs  Terminating program: oprint “hello world!”  Non-terminating program: owhile true continue  Termination can depend on input: oread x oif x = “hello!” then print “hello world!” oelse while true continue © F. Arbab 2010 Silly Questions, Infinity, & Other Things29

Halting Problem  Can we write a program h(p, i) to determine if program p will halt on input i?  No, this is impossible!  One of the first instances of concrete undecidable (provably unsolvable) problems.  Many other problems are shown to be unsolvable by reduction to the halting problem. © F. Arbab 2010 Silly Questions, Infinity, & Other Things30

Alan Mathison Turing  Born: 23 June 1912 Maida Vale, London, England Maida ValeLondonEngland  Died: 7 June 1954 (aged 41) Wilmslow, Cheshire, England WilmslowCheshire  WWII hero code breaker  Pioneered computer science oTuring machine: computability oTuring test: can machines think? oUndecidability of halting problem oEtc. © F. Arbab 2010 Silly Questions, Infinity, & Other Things31