IPA IPA Fall Days 2007 Beyond Turing Introduction Mark de Berg TU Eindhoven.

Slides:



Advertisements
Similar presentations
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Advertisements

Computation and representation Joe Lau. Overview of lecture What is computation? Brief history Computational explanations in cognitive science Levels.
Introduction Digital systems (logic design, digital logic, switching circuits) are employed in: computers data communication control systems many other.
Thurs., March 4, 1999 n Homework 2 due n Handout Homework 3 (Due Thurs., March 18) n Turing Test n Multivariate Logic and Event Spaces n Week 8: Subjective.
1 CSCI-2400 Models of Computation. 2 Computation CPU memory.
Chapter 1. Introduction This course is all about how computers work But what do we mean by a computer? –Different types: desktop, servers, embedded devices.
Lecture 5 Turing Machines
Green’s Tri-Level Hypothesis Behavioral: a person’s performance on specific experimental tasks Cognitive: the postulated cognitive or affective systems.
COMP 4640 Intelligent & Interactive Systems Cheryl Seals, Ph.D. Computer Science & Software Engineering Auburn University.
Computability to Practical Computing - and - How to Talk to Machines.
November 3, 2009Introduction to Cognitive Science Lecture 15: Theory of Computation II 1 Languages Accepted by Turing Machines Example 2: Language L =
TU/e IPA Herfstdagen 2004 Intelligent Algorithms Introduction Mark de Berg TU Eindhoven.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
Fall 2006Costas Busch - RPI1 CSCI-2400 Models of Computation.
Welcome to…. Psychology 85 Introduction to Cognitive Science Summer 2015 Instructor: Sean McAuliffe T.A.: Carolyn Bufford.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Fundamentals of Software Development 1Slide 1 Alan Mathison Turing (1912 – 1954) British mathematician, logician, and cryptographer,British.
The Study of Computer Science Chapter 0 Intro to Computer Science CS1510, Section 2.
Computer Science and Software Engineering© 2014 Project Lead The Way, Inc. Input, Output, State.
1.1 1 Introduction Foundations of Computer Science  Cengage Learning.
Philosophical issues in AI The mind-body problem The Turing Test.
Alan Turing ( ). Early Biography Born on June 23, 1912 in London, England Attended a prestigious public school where he showed promise in math.
Thoughts about Trends1 Chapter 5: How to Think about Trends R. W. Hamming (from Beyond Calculation)
Famous Firsts in Computation MSE 2400 Evolution & Learning
The Turing machine Olena Lastivka. Definition Turing machine is a theoretical device that manipulates symbols on a strip of tape according to a table.
©Brooks/Cole, 2003 Foundations of Computer Science from Data Manipulation to Theory of Computation Behrouz A. Forouzan, Brooks/Cole — Thomson Learning,
5. Alternative Approaches. Strategic Bahavior in Business and Econ 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game Theory 4. The.
A Theory of Interactive Computation Jan van Leeuwen, Jiri Widermann Presented by Choi, Chang-Beom KAIST.
Alan M. Turing ( ) A Natalie Cluck Presentation.
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
Chapter 1 Introduction.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
Introduction to Computing Muhammad Saeed. Topics Course Description Overview of Areas Contact Information.
Famous Mathematicians
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
Vector and symbolic processors
English and computing. Да Нет Question 1 Is a computer an electronic machine which can accept data and give the results of the processing in a format.
Senem KUMOVA METİN // Fall CS 115 Introduction to Programming Introduction to Computing.
DR. SIMING LIU SPRING 2016 COMPUTER SCIENCE AND ENGINEERING UNIVERSITY OF NEVADA, RENO CS 219 Computer Organization.
A Brief History of AI Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Alan Turing The ‘father’ of modern Computer Science.
CS 101 INTRODUCTION TO COMPUTING * image from The Central Eglinton Community Centre website.
COMP 4640 Intelligent & Interactive Systems Cheryl Seals, Ph.D. Computer Science & Software Engineering Auburn University.
Spring, 2011 –– Computational Thinking – Dennis Kafura – CS 2984 Lambda Calculus Introduction.
Von Neumann Architecture Stored-Program Architecture.
CS 154 Formal Languages and Computability April 5 Class Meeting Department of Computer Science San Jose State University Spring 2016 Instructor: Ron Mak.
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Chapter I: Introduction to Computer Science. Computer: is a machine that accepts input data, processes the data and creates output data. This is a specific-purpose.
Computer Science Introduction
WHAT IS INTELLIGENCE? Unit 1| Days
COMPUTER ARCHITECTURE AND THE CYNAIDE COATED APPLE.
Turing Machines Finite State Machines.
Class 30: Models of Computation CS200: Computer Science
Course 1 Introduction to Formal Languages and Automata Theory (part 1)
COMP3710 Artificial Intelligence Thompson Rivers University
Turing Machine
1.#.
COMP 4640 Intelligent & Interactive Systems
CSCI-2400 Models of Computation Costas Busch - RPI.
Ալգորիթմներ Stack, Queue, Tree.
P.V.G’s College of Engineering, Nashik
Class 34: Models of Computation CS200: Computer Science
COMP3710 Artificial Intelligence Thompson Rivers University
 Is a machine that is able to take information (input), do some work on (process), and to make new information (output) COMPUTER.
TIME-BASED HYBRID ANALOG-DIGITAL COMPUTATION
Artificial Intelligence
Arithmatic Logic Unit (ALU). ALU Input Data :  A0-A3  B0-B3 Output Data :  F0 – F3.
Computer System.
Presentation transcript:

IPA IPA Fall Days 2007 Beyond Turing Introduction Mark de Berg TU Eindhoven

IPA Fall Days 2007: Beyond Turing Focus Areas 2007–2012  Algorithms & Models for Life Sciences  Hybrid Systems  Model-Driven Software Engineering  Software analysis  Beyond Turing Summer 2007: reaccreditation by KNAW

IPA Fall Days 2007: Beyond Turing 1936: On computable numbers, with an aplication to the Entscheidungsproblem  Turing machine : The Bombe 1950: Computing machinery and intelligence  Turing test 1954: suicide by cyanide poisoning Alan Turing (1912 – 1954) British mathematician / computer scientist / philosopher / …

IPA Fall Days 2007: Beyond Turing Classical computing input output environment Turing machine / pointer machine / random-access machine  unbounded uniform memory  computations over finite alphabet  finite computations  behavior (algorithm) is fixed  no interaction with environment memory finite state machine

IPA Fall Days 2007: Beyond Turing Modern and/or future computing systems input output environment memory finite state machine  quantum- and other computers  no uniform, unbounded memory  systems are “always on”  interaction with environment and other algorithmic systems  environment and, hence, algorithmic systems evolve over time L1 cache L2 cache L3 cache registers main memory disk ALU environment

IPA Fall Days 2007: Beyond Turing MondayAlternative computational models I TuesdayInteracting algorithmic systems I Invited talk: Jiři Wiedermann (Prague) Interacting algorithmic systems II WednesdayEvolving algorithmic systems I Open session (-> contact Arie Middelkoop) ThursdayInteracting algorithmic systems II Invited talk: Jan Vahrenhold (Dortmund) Alternative computational models II Social event FridayEvolving algorithmic systems I Interacting algorithmic systems IV PROGRAM

IPA ENJOY! Fall Days 2007: Beyond Turing