Keith Fligg. 03-April-07

Similar documents
ENEE 459E/CMSC 498R In-class exercise February 10, 2015

Theory of Computation (IX) Yijia Chen Fudan University

Decidable Languages - relationship with other classes.

Alan Turing s Contributions to the Sciences

Handouts. CS701 Theory of Computation

CST Part IB. Computation Theory. Andrew Pitts

CS 301. Lecture 17 Church Turing thesis. Stephen Checkoway. March 19, 2018

CS187 - Science Gateway Seminar for CS and Math

Limits of Computation. Antonina Kolokolova

Theory of Computation

Register machines L2 18

COMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lec. 16 : Turing Machines

Most General computer?

CSCE 551: Chin-Tser Huang. University of South Carolina

CS3719 Theory of Computation and Algorithms

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

COMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lec. 14 : Turing Machines

Decidability. Human-aware Robotics. 2017/10/31 Chapter 4.1 in Sipser Ø Announcement:

CS6901: review of Theory of Computation and Algorithms

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta

COMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages

Hilbert s problems, Gödel, and the limits of computation

CURRICULUM MAP. Course/Subject: Honors Math I Grade: 10 Teacher: Davis. Month: September (19 instructional days)

IV. Turing Machine. Yuxi Fu. BASICS, Shanghai Jiao Tong University

A number that can be written as, where p and q are integers and q Number.

Computability Theory. CS215, Lecture 6,

Church s undecidability result

Large Numbers, Busy Beavers, Noncomputability and Incompleteness

MAA509: Quantum Computing and Information Introduction

Computational Complexity

Undecibability. Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not.

Part I: Definitions and Properties

and Models of Computation

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Computational Models Lecture 7, Spring 2009

Mathematics AIMM Scope and Sequence 176 Instructional Days 16 Units

Chapter 2 Algorithms and Computation

The roots of computability theory. September 5, 2016

Algebra SEMESTER ONE. K12.com { Pg. 1 } Course Overview. Unit 1: Algebra Basics. Unit 2: Properties of Real Numbers

Turing Machines A Turing Machine is a 7-tuple, (Q, Σ, Γ, δ, q0, qaccept, qreject), where Q, Σ, Γ are all finite

Propositions as Types

258 Handbook of Discrete and Combinatorial Mathematics

Parallelism and Machine Models

Undecidable Problems. Z. Sawa (TU Ostrava) Introd. to Theoretical Computer Science May 12, / 65

UNRESTRICTED GRAMMARS

CS 275 Automata and Formal Language Theory

Introduction to Computer Systems

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Computational Models - Lecture 6

Understanding Computation

Lecture 2. The Euclidean Algorithm and Numbers in Other Bases

Hilbert s Tenth Problem

A talk given at the City Univ. of Hong Kong on April 14, ON HILBERT S TENTH PROBLEM AND RELATED TOPICS

Computational Models Lecture 8 1

Turing Machines. Wolfgang Schreiner

1 Showing Recognizability

Lecture 19: Universality and Computability

Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018

Lesson 5b Solving Quadratic Equations

A NEW DEFINITION OF NATURAL NUMBERS And its Incidence on Teaching Mathematics Diego Pareja Heredia. Universidad del Quindío. Armenia.

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS

Adlai E. Stevenson High School Course Description

SEVENTH EDITION and EXPANDED SEVENTH EDITION

Section 3.6 Complex Zeros

Turing Machines Part II

CHAPTER 2 NUMBER SYSTEMS

What is Binary? Digital Systems and Information Representation. An Example. Physical Representation. Boolean Algebra

Introduction to computation. Lirong Xia

Space Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1

THE TEACHER UNDERSTANDS THE REAL NUMBER SYSTEM AND ITS STRUCTURE, OPERATIONS, ALGORITHMS, AND REPRESENTATIONS

Hilbert s problems, Gödel, and the limits of computation

The Church-Turing Thesis

CSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality

Grade 6 Math Circles October 20/21, Formalism and Languages: Beyond Regular Languages

Chapter 1: Introduction and mathematical preliminaries

CSCE 222 Discrete Structures for Computing

Introduction to Quantum Computation

MTH122: Algebra I. Course length: Two semesters. Materials: Algebra I: A Reference Guide and Problem Sets. Prerequisites: MTH112: Pre-Algebra

Fundamentals of Computer Science

GCSE AQA Mathematics. Numbers

Quiz 07a. Integers Modulo 12

Chapter 01: Introduction. Lesson 01 Evolution Computers Part 1: Mechanical Systems, Babbage method of Finite Difference Engine and Turing Hypothesis

Let s Do Algebra Tiles

Math Review. for the Quantitative Reasoning measure of the GRE General Test

CS6902 Theory of Computation and Algorithms

CS 208: Automata Theory and Logic

Universal Turing Machine. Lecture 20

ARITHMETIC AND BASIC ALGEBRA

7.1 The Origin of Computer Science

How to Make a Proof of Halting Problem More Convincing: A Pedagogical Remark

Decidability: Church-Turing Thesis

Discrete Structures for Computer Science

Discrete Mathematics 2007: Lecture 5 Infinite sets

Introductory Mathematics

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number

Handbook of Logic and Proof Techniques for Computer Science

COMP-330 Theory of Computation. Fall Prof. Claude Crépeau. Lecture 1 : Introduction

FORMAL LANGUAGES, AUTOMATA AND COMPUTATION

3. Algorithms. What matters? How fast do we solve the problem? How much computer resource do we need?

Transcription:

03-April-07

Part 1: Counting Review of Numbers Part 2:

Part 1: Counting Review of Numbers Numerical Representation in the Brain Part 2:

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Part 2:

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Binary Operations Part 2:

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Binary Operations Part 2: Who s who: Alan Turing

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Binary Operations Part 2: Who s who: Alan Turing What is?

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Binary Operations Part 2: Who s who: Alan Turing What is? What is an Algorithm?

Part 1: Counting Review of Numbers Numerical Representation in the Brain Ordering Binary Operations Part 2: Who s who: Alan Turing What is? What is an Algorithm? What Problems are Computable (solvable)?

Review of Numbers N Natural Numbers The natural numbers are either {0, 1, 2,... } or {1, 2,,... }, depending on who you are talking to. The natural numbers are infinite but denumerable (countable).

Review of Numbers N Natural Numbers The natural numbers are either {0, 1, 2,... } or {1, 2,,... }, depending on who you are talking to. The natural numbers are infinite but denumerable (countable). Z Integers The integers are {..., 2, 1, 0, 1, 2,... } and are also infinite and countable.

Review of Numbers N Natural Numbers The natural numbers are either {0, 1, 2,... } or {1, 2,,... }, depending on who you are talking to. The natural numbers are infinite but denumerable (countable). Z Integers The integers are {..., 2, 1, 0, 1, 2,... } and are also infinite and countable. R Real Numbers The reals are all infinite decimal representations of numbers on the interval (, + ). They are infinite and uncountable.

Numerical Representation in the Brain Humans and other animals share non-verbal representations of numerical quantities.

Numerical Representation in the Brain Humans and other animals share non-verbal representations of numerical quantities. These magnitudes suffer from scalar variability (noise).

Numerical Representation in the Brain Humans and other animals share non-verbal representations of numerical quantities. These magnitudes suffer from scalar variability (noise). They also obey Weber s law: I /I = k

Numerical Representation in the Brain Humans and other animals share non-verbal representations of numerical quantities. These magnitudes suffer from scalar variability (noise). They also obey Weber s law: I /I = k Countable (N) and uncountable (R) quantities are likely both stored as magnitudes.

Numerical Representation in the Brain Humans and other animals share non-verbal representations of numerical quantities. These magnitudes suffer from scalar variability (noise). They also obey Weber s law: I /I = k Countable (N) and uncountable (R) quantities are likely both stored as magnitudes. Numerosity and duration are represented by the same magnitudes

Ordering Subitizing is a non counting process for recognizing numbers smaller than five.

Ordering Subitizing is a non counting process for recognizing numbers smaller than five. Non-verbal counting process is likely shared between humans and other animals.

Ordering Subitizing is a non counting process for recognizing numbers smaller than five. Non-verbal counting process is likely shared between humans and other animals. We increment a counter that is represented by a magnitude and compare it to our stored target.

Ordering Subitizing is a non counting process for recognizing numbers smaller than five. Non-verbal counting process is likely shared between humans and other animals. We increment a counter that is represented by a magnitude and compare it to our stored target. Ordering of numbers is mediated by the magnitude representation in the brain.

Ordering Subitizing is a non counting process for recognizing numbers smaller than five. Non-verbal counting process is likely shared between humans and other animals. We increment a counter that is represented by a magnitude and compare it to our stored target. Ordering of numbers is mediated by the magnitude representation in the brain. Large, close numbers take longer to order.

Ordering Subitizing is a non counting process for recognizing numbers smaller than five. Non-verbal counting process is likely shared between humans and other animals. We increment a counter that is represented by a magnitude and compare it to our stored target. Ordering of numbers is mediated by the magnitude representation in the brain. Large, close numbers take longer to order. Abstract representations can be ordered.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object. time-left paradigm.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object. time-left paradigm. Multiplication and Division

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object. time-left paradigm. Multiplication and Division Weber s law?

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object. time-left paradigm. Multiplication and Division Weber s law? Arithmetic inference from behavioral effects.

Binary Operations Binary operations appear to be manipulations of internal magnitude representations. Addition Rhesus macaques were able to select arrays of Arabic numerals with the greatest sum. Chimpanzees were able to select the numeral that was the sum of two different, spatially separated numerals. Subtraction Rhesus macaques and the disappearing object. time-left paradigm. Multiplication and Division Weber s law? Arithmetic inference from behavioral effects. Division??

Alan Turing (1912-1954): Mathematician Turing Machine

Alan Turing (1912-1954): Mathematician Turing Machine Turing Test

Alan Turing (1912-1954): Mathematician Turing Machine Turing Test Me: Dylan, you re going to run into something. Why are you wearing that hat over your face? Dylan: I m a grinder soldier. Me: What does a grinder soldier do? Dylan: That means I eat crime. Me: You eat crime? What does crime taste like? Dylan: Oranges. - Ken Jennings

Alan Turing (1912-1954): Mathematician Turing Machine Turing Test Me: Dylan, you re going to run into something. Why are you wearing that hat over your face? Dylan: I m a grinder soldier. Me: What does a grinder soldier do? Dylan: That means I eat crime. Me: You eat crime? What does crime taste like? Dylan: Oranges. - Ken Jennings Designed the Bombe Simulated up to 36 German Enigma machines to break their codes.

Alan Turing (1912-1954): Mathematician Turing Machine Turing Test Me: Dylan, you re going to run into something. Why are you wearing that hat over your face? Dylan: I m a grinder soldier. Me: What does a grinder soldier do? Dylan: That means I eat crime. Me: You eat crime? What does crime taste like? Dylan: Oranges. - Ken Jennings Designed the Bombe Simulated up to 36 German Enigma machines to break their codes. The Chemical Basis of Morphogenesis (reaction-diffusion equations)

Alan Turing (1912-1954): Mathematician Turing Machine Turing Test Me: Dylan, you re going to run into something. Why are you wearing that hat over your face? Dylan: I m a grinder soldier. Me: What does a grinder soldier do? Dylan: That means I eat crime. Me: You eat crime? What does crime taste like? Dylan: Oranges. - Ken Jennings Designed the Bombe Simulated up to 36 German Enigma machines to break their codes. The Chemical Basis of Morphogenesis (reaction-diffusion equations) Fibonacci Phyllotaxis

What is? This is a good question with conflicting answers.

What is? This is a good question with conflicting answers. Performing arithmetic operations and reporting on and/or carrying out a prescribed action in relation to them. Does not include counting. (www.oalj.dol.gov/public/dot/refrnc/dotappb.htm)

What is? This is a good question with conflicting answers. Performing arithmetic operations and reporting on and/or carrying out a prescribed action in relation to them. Does not include counting. (www.oalj.dol.gov/public/dot/refrnc/dotappb.htm) Originally, the word computing was synonymous with counting and calculating, and a computer was a person who computes. Since the advent of the electronic computer, it has come to also mean the operation and usage of these machines, the electrical processes carried out within the computer hardware itself. (en.wikipedia.org/wiki/)

What is? This is a good question with conflicting answers. Performing arithmetic operations and reporting on and/or carrying out a prescribed action in relation to them. Does not include counting. (www.oalj.dol.gov/public/dot/refrnc/dotappb.htm) Originally, the word computing was synonymous with counting and calculating, and a computer was a person who computes. Since the advent of the electronic computer, it has come to also mean the operation and usage of these machines, the electrical processes carried out within the computer hardware itself. (en.wikipedia.org/wiki/) Evaluation of algorithms.

What is an Algorithm? In 1900, mathematician David Hilbert addressed the International Congress of Mathematicians in Paris and presented 10 (out from 23) unsolved problems. The tenth was to devise a test to determine if a polynomial has an integral root.

What is an Algorithm? In 1900, mathematician David Hilbert addressed the International Congress of Mathematicians in Paris and presented 10 (out from 23) unsolved problems. The tenth was to devise a test to determine if a polynomial has an integral root. Church-Turing thesis (1936): λ-calculus and Turing machines.

What is an Algorithm? In 1900, mathematician David Hilbert addressed the International Congress of Mathematicians in Paris and presented 10 (out from 23) unsolved problems. The tenth was to devise a test to determine if a polynomial has an integral root. Church-Turing thesis (1936): λ-calculus and Turing machines. An algorithm is a procedure (a finite set of well-defined instructions) for accomplishing some task which, given an initial state, will terminate in a defined end-state. (en.wikipedia.org/wiki/algorithm)

What is an Algorithm? In 1900, mathematician David Hilbert addressed the International Congress of Mathematicians in Paris and presented 10 (out from 23) unsolved problems. The tenth was to devise a test to determine if a polynomial has an integral root. Church-Turing thesis (1936): λ-calculus and Turing machines. An algorithm is a procedure (a finite set of well-defined instructions) for accomplishing some task which, given an initial state, will terminate in a defined end-state. (en.wikipedia.org/wiki/algorithm) Examples: FOIL, TSP, others?

What Problems are Computable (solvable)? Not very many with a very abstract definition of problem.

What Problems are Computable (solvable)? Not very many with a very abstract definition of problem. In fact there are infinitely more unsolvable problems than there are solvable ones.

What Problems are Computable (solvable)? Not very many with a very abstract definition of problem. In fact there are infinitely more unsolvable problems than there are solvable ones. In 1970 Yuri Matijasevič proved that there is no algorithm to determine if a polynomial has integral roots.

What Problems are Computable (solvable)? Not very many with a very abstract definition of problem. In fact there are infinitely more unsolvable problems than there are solvable ones. In 1970 Yuri Matijasevič proved that there is no algorithm to determine if a polynomial has integral roots. So, how do animals without computers solve problems (compute algorithms)? And how do they manage to solve all of their problems when we know that many of their problems can t be computed?