Computation. Philosophical Issues. Instructor: Viola Schiaffonati. March, 26 th 2018
|
|
- Sydney Davidson
- 5 years ago
- Views:
Transcription
1 Computation Philosophical Issues Instructor: Viola Schiaffonati March, 26 th 2018
2 Computer science: what kind of object? 2 Computer science: science/disciplines of computersor of computation? History of computers in terms of goals To realize a machine able to perform computations To establish foundations for mathematics Computer as a machine that can take, as input, patterns that describe changes to themselves and other patterns, and that causes the described changes to occur (Hayes 1997)
3 Computation 3 Central concept for computer science and for philosophical reflections about computer science Cluster conceptthat can be characterized in different ways (Scheutz 2002)s Intuitive perspective Historical perspective Philosophical perspective
4 Origins 4 Computation derives from the Latin com-putare which means to determine or to calculate especially by mathematical means Within computer science, computation means the execution of algorithms What is an algorithm? What does it mean to execute an algorithm?
5 Algorithm (intuitive definition) 5 Finite set of instructions, which operate on certain entities (symbols, representations of numbers, etc.) and can be implemented in some mechanism To execute an algorithm means to have the mechanismto carry out the instructions for any given input in a deterministic, discrete, stepwise fashion The mechanism goes through a sequence of atomic stepsin such a way that (one or more of) these steps correspond to some instruction, for all the instructions specified by the algorithm
6 Algorithms and mechanisms 6 Algorithmic specification will take different forms (depending on the kind of mechanism) In the case of computers it is expressed as a programming language In the case of humans instructions may be given in ordinary language(individual steps must be clearly distinguishable and described with sufficient precision) The concept of algorithm is tightly connected to that of mechanically realizable processes What is a mechanism Precise specification of the notion of algorithm
7 Historical perspective 7 Philosophers have been always analyzing the possibility to realize mechanical systemsto help humans making calculations (Davies 2012) First mechanical calculators in XVII century (Pascal) Leibniz and his calculus of thought (calculus ratiocinator) The idea of reasoningas a mechanical processis at the roots of the notion of computation From the beginning computation is connected to the idea of mechanically manipulated representations
8 The turning point 8 These ideas are formally developed during XX century and are concretely applied in the construction of the first electronic calculators developed starting from 1940s Major progresses in the construction of computersand the conception of computing are due to two independent developments The logical analysisof the notions formal systemand formal proof(leading to further studies of notions as effectively computable function and algorithm) The rapid progression in the engineering of electronic components
9 A logico-philosophical perspective 9 In the 1930s logicians start working for a well-defined formal notion of computationin order to make the intuitive notion of computation formally precise They focus on the class of functionsthat can be effectively calculated in principle(being logicians and digital computers not existing yet) Mathematician Alonzo Church (1936) is the first to give this class of effective calculable functions a formal characterization through a definition postulate In the same year Alan Turingintroduces his machine model to define A notion of effective procedure or algorithm A notion of function computed by an algorithm
10 On Computable Numbers(Turing 1936) 10 How to demonstrate that a procedure able to perform the requested task in an automatic way has not been invented yet and will not be invented in the future? The concept of mechanical process needs to be conceived in a precise and rigorous way The Turing Machine
11 Computability and algorithms 11 A function fis computablemeans by definition that there exists an algorithm that computes f An algorithm for a given problem Pcan be characterized as a finite procedure(a finite set of instructions) to solve P such that The algorithm is not ambiguousfor both the computer and the human being that will perform it The algorithm is effective, namely it must terminate and give back a correct solution to P
12 Turing machine 12 Unbounded tapedivided into squares, each of which can hold exactly one symbol, a tape headfor reading and writing symbols from a given alphabet on the square, and a controller, which is exactly one of finitely many states at any given time Each computational step involves, first, reading the symbol under the tape headand then, depending on the current state of the controller, writing a new symbol on the square, possibly switching to another state and possibly moving the tape head one square to the left or to the right
13 Action and configuration 13
14 Turing s approach 14 The notion of algorithm receives a satisfactory account only after Turing (1936) has introduced his machine model of a (human) computer This model results from Turing s analysis of the possible processes a human( the computer ) can go through while performing a calculation using paper and pencil applying rules from a given finite set The human computer follows the rules blindly, without using any insight or ingenuity
15 Turing: at the basis of computation 15 Five major constraints for doing automatic computations 1. Only a finite numberof symbolscan be written down and used in any computation 2. There is a fixed boundon the amount of scratch paper(and the symbols on it) that a human can take in at a time in order to decide what to do next 3. At any time a symbolcan be written downor erased(in a certain area on the scratch paper called cell ) 4. There is a upper limitto the distance between cells that can be considered in two consecutives computational steps 5. There is an upper boundto the number of states of mind a human can be in, and the current state of mind together with the last symbol written or erased determine what to do next
16 The type of model 16 Mathematicalmodel of an imagined mechanical device satisfying conditions 1-5 Idealizedmodel of human computing since it could process and store arbitrarily long, finite sequences of symbols Abstractmodel since it only captures high-level processes that take place in humans when they compute (as opposed to low-level neuronal processes, for example)
17 Turing computability 17 Any function computable by a humanbeing following fixed rules can be computed by a Turing machine Every function computed by a Turing machinecould (in principle) be computed by a human computer This equivalence does not preclude humans from being able to find answers to problems which no Turing machine can compute (for example using intuition)
18 Computational model 18 Three similar, but different expressions To be computable To be computational To be a computer
19 To be computable 19 X is computable Xis a functionfrom a numerable domain to a numerable codomain For each argument n of X,the corresponding value X(n) can be obtained by adopting a mechanical calculus(algorithm)
20 A task to be computable 20 A task is computableif it is possible to specify a sequence of instructionswhich will result in the completion of the taskwhen they are carried out by some machine Set of instructions called effective procedure or algorithm What counts as an effective procedure may dependon the capabilitiesof the machineused to carry out the instructions
21 Again on Turing computability 21 Turing s proposal of a class of devices known as Turing machines and lead to the formal notion of computation (Turing s computability) A task is Turing computable if it can be carried out by some Turing machine
22 Church-Turing thesis 22 The proposition that Turing s notion captures exactly the intuitive idea of effective procedure is called the Church- Turing thesis This proposition is not provable, since it is a claim about the relationship between a formal concept and intuition The thesis would be refuted by an intuitively accepted algorithm for a task that is not Turing-computable No such counterexample has been found
23 On the naturalness of computability 23 Other independently defined notions of computability Lambda calculus, Recursive functions, Post machines They have been shown to be equivalent to Turingcomputability This indicates that there is at least something natural about this notion of computability
24 To be computational 24 X is computational X is a model(representing something) Model X is formulated in terms of computable functions By extension Computational is a disciplinedeveloping computational models
25 To be a computer 25 X is a computer (Copeland 1996) (Hayes 1997) X is a physical system executing programs In the structure of the systems two distinct but connected components are identifiable Representation of a program Executor of a program
26 References 26 Church, A. (1936) An unsolvable problem of elementary number theory, American Journal of Mathematics 58: Hayes, P. (1997) WhatIsa Computer? An Electronic Discussion, The Monist 80:3 Davies, M. (2012) The Universal Computer: The Road from Leibniz to Turing, Taylor & Francis Group Scheutz, M. (2002) Philosophical Issues about Computation, Encyclopedia of Cognitive Science, Macmillan, London Turing, A. (1936) On computablenumbers, with an applicationto the Entscheidungsproblem, Proceedings of the London Mathematical Society, series 2, 42:
Title? Alan Turing and the Theoretical Foundation of the Information Age
BOOK REVIEW Title? Alan Turing and the Theoretical Foundation of the Information Age Chris Bernhardt, Turing s Vision: the Birth of Computer Science. Cambridge, MA: MIT Press 2016. xvii + 189 pp. $26.95
More informationOverview: The works of Alan Turing ( )
Overview: The works of Alan Turing (1912-1954) Dan Hallin 2005-10-21 Introduction Course in Computer Science (CD5600) The methodology of Science in Technology (CT3620) Mälardalen
More informationArtificial Intelligence
Politecnico di Milano Artificial Intelligence Artificial Intelligence What and When Viola Schiaffonati viola.schiaffonati@polimi.it What is artificial intelligence? When has been AI created? Are there
More informationCITS2211 Discrete Structures Turing Machines
CITS2211 Discrete Structures Turing Machines October 23, 2017 Highlights We have seen that FSMs and PDAs are surprisingly powerful But there are some languages they can not recognise We will study a new
More informationof the hypothesis, but it would not lead to a proof. P 1
Church-Turing thesis The intuitive notion of an effective procedure or algorithm has been mentioned several times. Today the Turing machine has become the accepted formalization of an algorithm. Clearly
More informationComputability. What can be computed?
Computability What can be computed? Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed? read/write tape 0 1 1 0 control Computability What can be computed?
More informationTechnical framework of Operating System using Turing Machines
Reviewed Paper Technical framework of Operating System using Turing Machines Paper ID IJIFR/ V2/ E2/ 028 Page No 465-470 Subject Area Computer Science Key Words Turing, Undesirability, Complexity, Snapshot
More informationReflector A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis
Reflector A Dynamic Manifestation of Turing Machines with Time and Space Complexity Analysis Behroz Mirza MS Computing, Shaheed Zulfikar Ali Bhutto Institute of Science and Technology 90 and 100 Clifton
More informationMachine and Thought: The Turing Test
Machine and Thought: The Turing Test Instructor: Viola Schiaffonati April, 7 th 2016 Machines and thought 2 The dream of intelligent machines The philosophical-scientific tradition The official birth of
More informationNotes for BASIC INFORMATION Cover Sheet
Notes for BASIC INFORMATION Cover Sheet (*) Estimated enrollment for CSE 584 is 10 15. Estimated enrollment for PHI 584 is 10 15. Estimated enrollment for CSE/PHI 484 is 25. Total estimated enrollment
More informationSmart Cities. SESSION I : Lecture 2: Turing s s Legacy. Michael
Monday 5 October, 2015 Smart Cities SESSION I : Lecture 2: Turing s s Legacy Michael Batty m.batty@ucl.ac.uk @jmichaelbatty http://www.spatialcomplexity.info/ http://www.casa.ucl.ac.uk/ How did it all
More informationBrain-inspired information processing: Beyond the Turing machine
Brain-inspired information processing: Beyond the Turing machine Herbert Jaeger Jacobs University Bremen Part 1: That is Computing! Turing computability Image sources are given on last slide Deep historical
More informationA Definition of Artificial Intelligence
A Definition of Artificial Intelligence arxiv:1210.1568v1 [cs.ai] 3 Oct 2012 Dimiter Dobrev Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia 1090, BULGARIA e-mail: d@dobrev.com
More informationTo wards Empirical and Scientific Theories of Computation
To wards Empirical and Scientific Theories of Computation (Extended Abstract) Steven Meyer Pragmatic C Software Corp., Minneapolis, MN, USA smeyer@tdl.com Abstract The current situation in empirical testing
More informationPhilosophy. AI Slides (5e) c Lin
Philosophy 15 AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 15 1 15 Philosophy 15.1 AI philosophy 15.2 Weak AI 15.3 Strong AI 15.4 Ethics 15.5 The future of AI AI Slides (5e) c Lin Zuoquan@PKU 2003-2018 15
More informationLogical Agents (AIMA - Chapter 7)
Logical Agents (AIMA - Chapter 7) CIS 391 - Intro to AI 1 Outline 1. Wumpus world 2. Logic-based agents 3. Propositional logic Syntax, semantics, inference, validity, equivalence and satifiability Next
More information11/18/2015. Outline. Logical Agents. The Wumpus World. 1. Automating Hunt the Wumpus : A different kind of problem
Outline Logical Agents (AIMA - Chapter 7) 1. Wumpus world 2. Logic-based agents 3. Propositional logic Syntax, semantics, inference, validity, equivalence and satifiability Next Time: Automated Propositional
More informationDVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
More informationThe Irrelevance of Turing Machines to AI
To appear in a book edited by Matthias Scheutz The Irrelevance of Turing Machines to AI Aaron Sloman University of Birmingham http://www.cs.bham.ac.uk/ axs/ Contents 1 Introduction 2 2 Two Strands of Development
More informationTiling Problems. This document supersedes the earlier notes posted about the tiling problem. 1 An Undecidable Problem about Tilings of the Plane
Tiling Problems This document supersedes the earlier notes posted about the tiling problem. 1 An Undecidable Problem about Tilings of the Plane The undecidable problems we saw at the start of our unit
More informationAutomata and Formal Languages - CM0081 Turing Machines
Automata and Formal Languages - CM0081 Turing Machines Andrés Sicard-Ramírez Universidad EAFIT Semester 2018-1 Turing Machines Alan Mathison Turing (1912 1954) Automata and Formal Languages - CM0081. Turing
More informationFrom Turing Machines to Building a Brain
From Turing Machines to Building a Brain Including an introduction to Philosophy of Mind Church-Turing Thesis Turing was beaten to the punch in his solution to the Entscheidungsproblem Alonzo Church announced
More informationImplications as rules
DIPLEAP Wien 27.11.2010 p. 1 Implications as rules Thomas Piecha Peter Schroeder-Heister Wilhelm-Schickard-Institut für Informatik Universität Tübingen DIPLEAP Wien 27.11.2010 p. 2 Philosophical / foundational
More informationCDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES
CDT314 FABER Formal Languages, Automata and Models of Computation MARK BURGIN INDUCTIVE TURING MACHINES 2012 1 Inductive Turing Machines Burgin, M. Inductive Turing Machines, Notices of the Academy of
More informationPart I. Four Concepts
Part I Four Concepts B. Jack Copeland 2 Computation Chapter 1 Computation B. Jack Copeland The Birth of the Modern Computer As everyone who can operate a personal computer knows, the way to make the machine
More informationImplementation of Recursively Enumerable Languages in Universal Turing Machine
Implementation of Recursively Enumerable Languages in Universal Turing Machine Sumitha C.H, Member, ICMLC and Krupa Ophelia Geddam Abstract This paper presents the design and working of a Universal Turing
More informationTHE RISE AND FALL OF THE CHURCH-TURING THESIS Mark Burgin
THE RISE AND FALL OF THE CHURCH-TURING THESIS Mark Burgin Department of Mathematics University of California, Los Angeles Los Angeles, CA 90095 Abstract: The essay consists of three parts. In the first
More informationTuring s model of the mind
Published in J. Copeland, J. Bowen, M. Sprevak & R. Wilson (Eds.) The Turing Guide: Life, Work, Legacy (2017), Oxford: Oxford University Press mark.sprevak@ed.ac.uk Turing s model of the mind Mark Sprevak
More informationSequential program, state machine, Concurrent process models
INSIGHT Sequential program, state machine, Concurrent process models Finite State Machines, or automata, originated in computational theory and mathematical models in support of various fields of bioscience.
More informationFormalising Event Reconstruction in Digital Investigations
Formalising Event Reconstruction in Digital Investigations Pavel Gladyshev The thesis is submitted to University College Dublin for the degree of PhD in the Faculty of Science August 2004 Department of
More informationComputer Science as a Discipline
Computer Science as a Discipline 1 Computer Science some people argue that computer science is not a science in the same sense that biology and chemistry are the interdisciplinary nature of computer science
More informationIntroduction to Computer Science
Introduction to CS, 2003 p.1 Introduction to Computer Science Ian Leslie with thanks to Robin Milner, Andrew Pitts and others... Computer Laboratory In the beginning... Introduction to CS, 2003 p.2 Introduction
More informationIntroduction to cognitive science Session 3: Cognitivism
Introduction to cognitive science Session 3: Cognitivism Martin Takáč Centre for cognitive science DAI FMFI Comenius University in Bratislava Príprava štúdia matematiky a informatiky na FMFI UK v anglickom
More informationChapter 7 Information Redux
Chapter 7 Information Redux Information exists at the core of human activities such as observing, reasoning, and communicating. Information serves a foundational role in these areas, similar to the role
More informationA MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 2, February 1997, Pages 547 554 S 0002-9939(97)03614-9 A MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM STEVEN
More informationA Brief History of Computer Science and Computing
A Brief History of Computer Science and Computing Tim Capes April 4, 2011 Administrative Announcements Midterms are returned today, A4 is scheduled to go out on thursday. Early Computing First computing
More informationSay My Name. An Objection to Ante Rem Structuralism. Tim Räz. July 29, 2014
Say My Name. An Objection to Ante Rem Structuralism Tim Räz July 29, 2014 Abstract In this paper I raise an objection to ante rem structuralism, proposed by Stewart Shapiro: I show that it is in conflict
More informationTuring Machines (TM)
1 Introduction Turing Machines (TM) Jay Bagga A Turing Machine (TM) is a powerful model which represents a general purpose computer. The Church-Turing thesis states that our intuitive notion of algorithms
More informationA Balanced Introduction to Computer Science, 3/E
A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN 978-0-13-216675-1 Chapter 10 Computer Science as a Discipline 1 Computer Science some people
More information10/4/10. An overview using Alan Turing s Forgotten Ideas in Computer Science as well as sources listed on last slide.
Well known for the machine, test and thesis that bear his name, the British genius also anticipated neural- network computers and hyper- computation. An overview using Alan Turing s Forgotten Ideas in
More informationPAPER. Connecting the dots. Giovanna Roda Vienna, Austria
PAPER Connecting the dots Giovanna Roda Vienna, Austria giovanna.roda@gmail.com Abstract Symbolic Computation is an area of computer science that after 20 years of initial research had its acme in the
More informationCSE 355: Human-aware Robo.cs Introduction to Theoretical Computer Science
CSE 355: Introduction to Theoretical Computer Science Instructor: Dr. Yu ( Tony ) Zhang Lecture: WGHL101, Tue/Thu, 3:00 4:15 PM Office Hours: BYENG 594, Tue/Thu, 5:00 6:00PM 1 Subject of interest? 2 Robo.cs
More informationIDK0310 AUTOMATED AND SYSTEMATISED LEGAL PROCESS. Ermo Täks
IDK0310 AUTOMATED AND SYSTEMATISED LEGAL PROCESS Ermo Täks Introducton What is Artificial Intelligence (AI)? How this is connected to law? Artificial Intelligence and law Discipline is broadly named also
More informationTropes and Facts. onathan Bennett (1988), following Zeno Vendler (1967), distinguishes between events and facts. Consider the indicative sentence
URIAH KRIEGEL Tropes and Facts INTRODUCTION/ABSTRACT The notion that there is a single type of entity in terms of which the whole world can be described has fallen out of favor in recent Ontology. There
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationAwareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose
Awareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose John McCarthy Computer Science Department Stanford University Stanford, CA 94305. jmc@sail.stanford.edu
More informationOracle Turing Machine. Kaixiang Wang
Oracle Turing Machine Kaixiang Wang Pre-background: What is Turing machine Oracle Turing Machine Definition Function Complexity Why Oracle Turing Machine is important Application of Oracle Turing Machine
More informationCounting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More information@CRC Press. Discrete Mathematics. with Ducks. sarah-marie belcastro. let this be your watchword. serious mathematics treated with levity
Discrete Mathematics with Ducks sarah-marie belcastro serious mathematics treated with levity let this be your watchword @CRC Press Taylor & Francis Croup Boca Raton London New York CRC Press is an imprint
More informationChapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION
Chapter 3 PRINCIPLE OF INCLUSION AND EXCLUSION 3.1 The basics Consider a set of N obects and r properties that each obect may or may not have each one of them. Let the properties be a 1,a,..., a r. Let
More informationLatin Squares for Elementary and Middle Grades
Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many
More information18 Completeness and Compactness of First-Order Tableaux
CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness
More informationFrom a Ball Game to Incompleteness
From a Ball Game to Incompleteness Arindama Singh We present a ball game that can be continued as long as we wish. It looks as though the game would never end. But by applying a result on trees, we show
More informationIntelligent Systems. Lecture 1 - Introduction
Intelligent Systems Lecture 1 - Introduction In which we try to explain why we consider artificial intelligence to be a subject most worthy of study, and in which we try to decide what exactly it is Dr.
More informationDigital image processing vs. computer vision Higher-level anchoring
Digital image processing vs. computer vision Higher-level anchoring Václav Hlaváč Czech Technical University in Prague Faculty of Electrical Engineering, Department of Cybernetics Center for Machine Perception
More information1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today
More informationA celebration of Alan Turing s achievements in the year of his centenary
Intl. Trans. in Op. Res. 19 (2012) 487 491 DOI: 10.1111/j.1475-3995.2012.00848.x INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH A celebration of Alan Turing s achievements in the year of his centenary
More informationMinds and Machines spring Searle s Chinese room argument, contd. Armstrong library reserves recitations slides handouts
Minds and Machines spring 2005 Image removed for copyright reasons. Searle s Chinese room argument, contd. Armstrong library reserves recitations slides handouts 1 intentionality underived: the belief
More informationCS415 Human Computer Interaction
CS415 Human Computer Interaction Lecture 11 Advanced HCI Intro to Cognitive Models November 3, 2016 Sam Siewert Assignments Assignment #5 Propose Group Project (Groups of 3) Assignment #6 Project Final
More informationWhat is a Sorting Function?
Department of Computer Science University of Copenhagen Email: henglein@diku.dk WG 2.8 2008, Park City, June 15-22, 2008 Outline 1 Sorting algorithms Literature definitions What is a sorting criterion?
More informationLight Up is NP-complete
Light Up is NP-complete Brandon McPhail February 8, 5 ( ) w a b a b z y Figure : An OR/NOR gate for our encoding of logic circuits as a Light Up puzzle. Abstract Light Up is one of many paper-and-pencil
More informationIf intelligence is uncomputable, then * Peter Kugel Computer Science Department, Boston College
If intelligence is uncomputable, then * Peter Kugel Computer Science Department, Boston College Intelligent behaviour presumably consists in a departure from the completely disciplined behaviour involved
More informationCSC475 Music Information Retrieval
CSC475 Music Information Retrieval Sinusoids and DSP notation George Tzanetakis University of Victoria 2014 G. Tzanetakis 1 / 38 Table of Contents I 1 Time and Frequency 2 Sinusoids and Phasors G. Tzanetakis
More informationPhilosophy and the Human Situation Artificial Intelligence
Philosophy and the Human Situation Artificial Intelligence Tim Crane In 1965, Herbert Simon, one of the pioneers of the new science of Artificial Intelligence, predicted that machines will be capable,
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11
EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 11 Counting As we saw in our discussion for uniform discrete probability, being able to count the number of elements of
More informationDice Activities for Algebraic Thinking
Foreword Dice Activities for Algebraic Thinking Successful math students use the concepts of algebra patterns, relationships, functions, and symbolic representations in constructing solutions to mathematical
More informationLecture 20 November 13, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 20 November 13, 2014 Scribes: Chennah Heroor 1 Overview This lecture completes our lectures on game characterization.
More informationFORMAL MODELING AND VERIFICATION OF MULTI-AGENTS SYSTEM USING WELL- FORMED NETS
FORMAL MODELING AND VERIFICATION OF MULTI-AGENTS SYSTEM USING WELL- FORMED NETS Meriem Taibi 1 and Malika Ioualalen 1 1 LSI - USTHB - BP 32, El-Alia, Bab-Ezzouar, 16111 - Alger, Algerie taibi,ioualalen@lsi-usthb.dz
More informationOne computer theorist s view of cognitive systems
One computer theorist s view of cognitive systems Jiri Wiedermann Institute of Computer Science, Prague Academy of Sciences of the Czech Republic Partially supported by grant 1ET100300419 Outline 1. The
More informationFormal Verification. Lecture 5: Computation Tree Logic (CTL)
Formal Verification Lecture 5: Computation Tree Logic (CTL) Jacques Fleuriot 1 jdf@inf.ac.uk 1 With thanks to Bob Atkey for some of the diagrams. Recap Previously: Linear-time Temporal Logic This time:
More informationComputability of Tilings
Computability of Tilings Grégory Lafitte and Michael Weiss Abstract Wang tiles are unit size squares with colored edges. To know whether a given finite set of Wang tiles can tile the plane while respecting
More informationCSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Parallel Computation and Complexity Classes John Savage Brown University April 13, 2009 John Savage (Brown University) CSCI 1590 Intro to Computational Complexity
More informationMembrane Computing as Multi Turing Machines
Volume 4 No.8, December 2012 www.ijais.org Membrane Computing as Multi Turing Machines Mahmoud Abdelaziz Amr Badr Ibrahim Farag ABSTRACT A Turing machine (TM) can be adapted to simulate the logic of any
More informationComputing and Communications 2. Information Theory -Channel Capacity
1896 1920 1987 2006 Computing and Communications 2. Information Theory -Channel Capacity Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Communication
More informationA FORMAL METHOD FOR MAPPING SOFTWARE ENGINEERING PRACTICES TO ESSENCE
A FORMAL METHOD FOR MAPPING SOFTWARE ENGINEERING PRACTICES TO ESSENCE Murat Pasa Uysal Department of Management Information Systems, Başkent University, Ankara, Turkey ABSTRACT Essence Framework (EF) aims
More informationOn the Power of Interactive Computing
On the Power of Interactive Computing Jan van Leeuwen 1 and Jiří Wiedermann 2 1 Department of Computer Science, Utrecht University, Padualaan 14, 3584 CH Utrecht, the Netherlands. 2 Institute of Computer
More informationCS 188 Introduction to Fall 2014 Artificial Intelligence Midterm
CS 88 Introduction to Fall Artificial Intelligence Midterm INSTRUCTIONS You have 8 minutes. The exam is closed book, closed notes except a one-page crib sheet. Please use non-programmable calculators only.
More informationCSC 550: Introduction to Artificial Intelligence. Fall 2004
CSC 550: Introduction to Artificial Intelligence Fall 2004 See online syllabus at: http://www.creighton.edu/~davereed/csc550 Course goals: survey the field of Artificial Intelligence, including major areas
More informationTIME encoding of a band-limited function,,
672 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 8, AUGUST 2006 Time Encoding Machines With Multiplicative Coupling, Feedforward, and Feedback Aurel A. Lazar, Fellow, IEEE
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More informationCE213 Artificial Intelligence Lecture 1
CE213 Artificial Intelligence Lecture 1 Module supervisor: Prof. John Gan, Email: jqgan, Office: 4B.524 Homepage: http://csee.essex.ac.uk/staff/jqgan/ CE213 website: http://orb.essex.ac.uk/ce/ce213/ Learning
More informationDomain Engineering. book by Dines Bjørner, presentation by Tero Hasu. February 9, Dines Bjørner 3. 2 a domain 4.
Domain Engineering book by Dines Bjørner, presentation by Tero Hasu February 9, 2012 Contents 1 Dines Bjørner 3 2 a domain 4 3 some domains 4 4 To understand is all. 4 5 motivation 5 6 problems 5 7 a domain
More informationTechniques for Generating Sudoku Instances
Chapter Techniques for Generating Sudoku Instances Overview Sudoku puzzles become worldwide popular among many players in different intellectual levels. In this chapter, we are going to discuss different
More informationIntroduction to Computer Engineering. CS/ECE 252, Spring 2013 Prof. Mark D. Hill Computer Sciences Department University of Wisconsin Madison
Introduction to Computer Engineering CS/ECE 252, Spring 2013 Prof. Mark D. Hill Computer Sciences Department University of Wisconsin Madison Chapter 1 Welcome Aboard Slides based on set prepared by Gregory
More information*Unit 1 Constructions and Transformations
*Unit 1 Constructions and Transformations Content Area: Mathematics Course(s): Geometry CP, Geometry Honors Time Period: September Length: 10 blocks Status: Published Transfer Skills Previous coursework:
More informationII Year (04 Semester) EE6403 Discrete Time Systems and Signal Processing
Class Subject Code Subject II Year (04 Semester) EE6403 Discrete Time Systems and Signal Processing 1.CONTENT LIST: Introduction to Unit I - Signals and Systems 2. SKILLS ADDRESSED: Listening 3. OBJECTIVE
More informationThe Science In Computer Science
Editor s Introduction Ubiquity Symposium The Science In Computer Science The Computing Sciences and STEM Education by Paul S. Rosenbloom In this latest installment of The Science in Computer Science, Prof.
More informationSokoban: Reversed Solving
Sokoban: Reversed Solving Frank Takes (ftakes@liacs.nl) Leiden Institute of Advanced Computer Science (LIACS), Leiden University June 20, 2008 Abstract This article describes a new method for attempting
More informationCS 540: Introduction to Artificial Intelligence
CS 540: Introduction to Artificial Intelligence Mid Exam: 7:15-9:15 pm, October 25, 2000 Room 1240 CS & Stats CLOSED BOOK (one sheet of notes and a calculator allowed) Write your answers on these pages
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients
More informationFORMAL DEFINITION OF ARTIFICIAL INTELLIGENCE 1
International Journal "Information Theories & Applications" Vol.12 277 Further works includes services implementation in GRID environment, which will connect computational cluster and other computational
More informationintentionality Minds and Machines spring 2006 the Chinese room Turing machines digression on Turing machines recitations
24.09 Minds and Machines intentionality underived: the belief that Fido is a dog the desire for a walk the intention to use Fido to refer to Fido recitations derived: the English sentence Fido is a dog
More informationComputing and Computation
Computing and Computation Paul S. Rosenbloom University of Southern California Over the past few years I have been engaged in an effort to understand computing as a scientific domain [Rosenbloom, 2004,
More informationInformatics: Science or Téchne? Informática: Ciência ou Téchne?
Tito Marques Palmeiro Informatics: Science or Téchne? Informática: Ciência ou Téchne? Abstract Informatics is generally understood as a new technology and is therewith discussed according to technological
More informationStaircase Rook Polynomials and Cayley s Game of Mousetrap
Staircase Rook Polynomials and Cayley s Game of Mousetrap Michael Z. Spivey Department of Mathematics and Computer Science University of Puget Sound Tacoma, Washington 98416-1043 USA mspivey@ups.edu Phone:
More informationOn the isomorphism problem of Coxeter groups and related topics
On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationIntroduction to AI. What is Artificial Intelligence?
Introduction to AI Instructor: Dr. Wei Ding Fall 2009 1 What is Artificial Intelligence? Views of AI fall into four categories: Thinking Humanly Thinking Rationally Acting Humanly Acting Rationally The
More informationEuropean Journal of Combinatorics. Staircase rook polynomials and Cayley s game of Mousetrap
European Journal of Combinatorics 30 (2009) 532 539 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Staircase rook polynomials
More information