Informação e Computação para a Inteligência Artificial
|
|
- Regina Welch
- 5 years ago
- Views:
Transcription
1 Informação e Computação para a Inteligência Artificial Andreas Wichert MEIC Tagus (Página da cadeira: Fenix) Objectivo Geral Apresentaremos uma visão compreensiva da ciência da informação como uma parte fundamental das áreas da inteligência artificial e da computação Exemplos na teoria da computação, que levarão às ideias de Qubits e à possível maneira de simular um computador quantum, serão fornecidos A simulação de software com a utilização do Mathematica será realizada para o suporte à explicação das ideias por trás dos computadores quantum 1
2 Organization Program Introduction Corpo docente Andreas Wichert - Teóricas / Práticas andreas.wichert@tagus.ist.utl.pt andreas.wichert@inesc-id.pt 2
3 Organização das aulas Teóricas: Matéria (slides baseados no livro e artigos e...) Práticas/Laboratório (weekly!): Exercícios Software Experiments Avaliação Problemas praticas (Exercícios) (40%) + Exame orais (60%)! 3
4 Bibliografia (Main) Howard L. Resnikoff. The Illusion of Reality. Springer-Verlag, 1987 Colin P. Williams and Scott H. Clearwater. Explorations in Quantum Computing, Springer- Verlag 1997 Bibliografia Quantum Computing, Mika Hirvensalo, Springer-Verlag, 2001 Complexity, Entropy and The Physics of Information, Wojciech H. Zurek, Addison- Wesley,
5 Programa 1. Introduction 2. Entropy - Information 3. Information 4. Information Measurement 5. Physical Information measurement 6. Principles of Information-Processing Systems and Signal Detection Programa 7. Biological Signal Detection and Information Processing 8. Hierarchical Neural Networks 9. Associative Memory and Information Theory 10. The capabilities of computing machinery 11. Quantum Mechanics and Computers 12. Quantum Computers 5
6 Programa 13. Effects of Imperfection 14. Breaking Unbreakable Codes 15. True Randomness 16. Quantum Cryptography 17 Crover`s Search Algorithm 1 18 Crover`s Search Algorithm 2 Programa 19 Quantum Teleportation 20. Quantum Error Correction 21. How to make a Quantum Computer 22. Complexity Lower Bounds for Quantum Circuits 23.AI, Entropy and The Physics of Information 24. The New AI and its applications 6
7 What is Information? Information first began to assume an independent and quantifiable identity in the research of physics and psychologists in the second half of the nineteenth century... It grew in importance with the development of electrical-based communication systems Emerged as a unifying and coherent scientific concept along with the invention and development of computers The subject matter of a science of information is abstract, for it concerns not the substance and the forces of the physical world (?) 7
8 Representation Symbolic tokens are necessarily represented by physical phenomena thoughts are represented by the electrical and biochemical states of the neural network There is an intermixing of the physical sciences with the proper subject matter of information science... Information can be presented in a variety of forms which differ inessential from one another Natural language Symbols Acoustic speech Pictures 8
9 Information is what remains after one abstracts from the material aspect of the physical reality... How to do it? Scientific study of information cannot be separated from systems which are capable of bearing information Information database and a user Meaning - Information Information has an independent reality, meaning does not Meaning involves the interpretation of the information in relation to some context Information exists It does not need to be perceived to exist 9
10 Information = Pattern What is a pattern? Find measure of it... The Library of Babel The universe (which others call the Library) is composed of an indefinite and perhaps infinite number of hexagonal galleries, with vast air shafts between, surrounded by very low railings Jorge Luis Borges ( ) 10
11 The books contain every possible ordering of just a few basic characters (letters, spaces and punctuation marks) Though the majority of the books in this universe are pure gibberish, the library also must contain, somewhere, every coherent book ever written, or that might ever be written, and every possible permutation or slightly erroneous version of every one of those books The library must contain all useful information, including predictions of the future, biographies of any person, and translations of every book in all languages 11
12 Despite - indeed, because of -this glut of information, all books are totally useless to the reader Borges speculates on the existence of the "Crimson Hexagon", containing a book that contains the log of all the other books; the librarian who reads it is akin to God The Library contains books Just one "authentic" volume, together with all those variants containing only a handful of misprints, would occupy so much space that they would fill the known universe 12
13 Constraints In a language Some letters are more frequent then others Some combination of letters are less probable History - Physics and Information Thermodynamics is a branch of physics that studies the effects of changes in temperature, pressure, and volume on physical systems at the macroscopic scale by analyzing the collective motion of their particles using statistics 13
14 Suggestions thermodynamically descriptions are not descriptions of physical properties and relationship themselves, but of some other still more fundamental property coeval with all regimes of physical inquiry Thermodynamically relations might remain valid for all physical theories which can describe an aspect of nature Thermodynamically quantities link physical entities to their organization, to their informational properties, and that the informational structure Probability enter into thermodynamically considerations and opened as road for abstractions and generalization 14
15 Selective Omission of Information Sensory data is corrupted and modified by sensing organism in ways which greatly reduce its quantity and substantially modify its original form Retaining essential information What is an A? What makes something similar to something else (specifically what makes, for example, an uppercase letter 'A' recognisable as such) Metamagical Themas, Douglas Hoffstader, Basic Books,
16 Chess Game tree in chess playing, which determines all possible consequences of alternative plays has a combinatorial complexity which surpasses the ability of any computing machine to explore it completely The complexity is however reduced by selectively omitting most of the pathways (heuristics) 16
17 The omitted ones are expected to be unproductive Selective omission in context of a decision problem which involves searching through a complex tree the application of heuristics procedures AI-Example: Blocks World planing with and without similarity heuristic similarity to the target state represented as picture 17
18 Measurement Eye us sensitive to photons of light which are governed by the wave-particle duality of quantum physics Breakdown of classical physics, was due to the improper extension of naïve concepts of measurement from the realm of everyday life Accuracy of measurement of the position of an object interfered with the accuracy of measurement of its velocity of motion (momentum) All physical measurements are, ultimately statistical in the sense that repeated measurements of identical physical situations will not lead to identical results, but only measurements which are collectively related to one another by a statistical law 18
19 Measurement, some information is lost, and whenever a measurement is performed, and that the degree of organization of the universe continually decreases Digital - Analog 19
20 Computation The information which went into the computer is different from what came out The most influential model of computation is the Turing Machine The Idea of the Turing Machine grew out of on attempt to answer a question proposed by the German mathematician Hilbert in the 1900 in the International Congress of Mathematics held in Paris concerning that he be lived to be the 23 most challenging mathematical problems of the day 20
21 The possibility that quantum mechanical effects might offer some thing genuinely new was first hinted by Richard Feynman of Caltech 1982 when he showed that no classical TM could cimulate certain quantum phenomena without incurring an exponential slowdown, but that a unversal quantum simulator could do so Quantum TM has the potential for encoding many inputs to a problem simultaneously on the same tape and performing a calculation on all inputs in the time it took to do just one of the calculations classically... 21
22 Quantum computers could compute certain outputs, such as true random numbers, that are not computable by any deterministic TM There is no function that generates true random numbers Quantum parallelsism All the outputs are computed in the time taken to evaluate just one output classically Unfortunately, you cannot obtain all of these outputs explicity because a measurment in the final supeposed state would only yield one output! In principle a QTM could be used to create a proof that relied upon quantum mechanical inference among all the computations going on in superposition Upon interrogating the QTM for an answer you might be told yes your assumption is true but there would be no way to exibit all computation steps that had gone in order to arrive at the conclusion... 22
23 Worse, if you tried to peek inside the QTM as it is working, to get some information about the state of the proof at that time, you would invariably disrupt the future course of the proof... Organization Program Introduction 23
Informação e Computação para a Inteligência Artificial!
Informação e Computação para a Inteligência Artificial! Andreas Wichert!! MEIC Tagus! (Página da cadeira: Fenix)!! Objectivo Geral! n Apresentaremos uma visão compreensiva da ciência da informação como
More informationAprendizagem Simbólica e Sub-Simbólica!
Aprendizagem Simbólica e Sub-Simbólica! Andreas Wichert!! DEIC! (Página da cadeira: Fenix)!! Objectivo Geral! n Ao contrário de muitas abordagens estatísticas de aprendizagem através de máquinas, que lidam
More informationChapter 1. Introduction
Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,
More informationcomplex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY
complex networks and systems Informatics luis rocha 2019 i609: advanced PhD seminar I luis m. rocha school of informatics, computing, & engineering indiana university, bloomington, usa and instituto gulbenkian
More informationQuantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )
Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson
More informationHugh Everett III s Many Worlds
236 My God, He Plays Dice! Hugh Everett III s Many Worlds Many Worlds 237 Hugh Everett III s Many Worlds Hugh Everett III was one of John Wheeler s most famous graduate students. Others included Richard
More informationARTiFiCiAL intelligence
PRiNCiPLES OF QUANTUM ARTiFiCiAL intelligence This page intentionally left blank PRiNCiPLES OF QUANTUM ARTiFiCiAL intelligence Andreas Wichert Instituto Superior Técnico - Universidade de Lisboa, Portugal
More informationCausality & Duality. William Hatcher. Copyright 2008, The Estate of William S. Hatcher
Causality & Duality William Hatcher 1 The Bahá í writings clearly affirm that the principle of existence in the material world is composition (all material entities are composites), whereas spiritual entities
More informationAn Intuitive Introduction to Motivic Homotopy Theory Vladimir Voevodsky
What follows is Vladimir Voevodsky s snapshot of his Fields Medal work on motivic homotopy, plus a little philosophy and from my point of view the main fun of doing mathematics Voevodsky (2002). Voevodsky
More informationFundamentals of Computer Science
Fundamentals of Computer Science Chapter 8: Turing machines Henrik Björklund Umeå University February 17, 2014 The power of automata Finite automata have only finite memory. They recognize the regular
More informationThe Limit of Humanly Knowable Mathematical Truth
The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument
More informationWe prove that the creator is infinite Turing machine or infinite Cellular-automaton.
Do people leave in Matrix? Information, entropy, time and cellular-automata The paper proves that we leave in Matrix. We show that Matrix was built by the creator. By this we solve the question how everything
More informationThermodynamics: Entropy
Thermodynamics: Entropy From Warmup I've heard people say that the Entropy Statement of the Second Law of Thermodynamics disproves God. Why is this? What are your thoughts? The second law of thermodynamics
More informationTuring Machine properties. Turing Machines. Alternate TM definitions. Alternate TM definitions. Alternate TM definitions. Alternate TM definitions
Turing Machine properties Turing Machines TM Variants and the Universal TM There are many ways to skin a cat And many ways to define a TM The book s Standard Turing Machines Tape unbounded on both sides
More informationCS4026 Formal Models of Computation
CS4026 Formal Models of Computation Turing Machines Turing Machines Abstract but accurate model of computers Proposed by Alan Turing in 1936 There weren t computers back then! Turing s motivation: find
More informationEmphasize physical realizability.
Emphasize physical realizability. The conventional approach is to measure complexity via SPACE & TIME, which are inherently unbounded by their nature. An alternative approach is to count the MATTER & ENERGY
More information226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement
226 My God, He Plays Dice! Entanglement Chapter 29 20 This chapter on the web informationphilosopher.com/problems/entanglement Entanglement 227 Entanglement Entanglement is a mysterious quantum phenomenon
More informationCOPENHAGEN INTERPRETATION:
QUANTUM PHILOSOPHY PCES 4.41 Perhaps the most difficult things to understand about QM are (i) how to reconcile our common sense ideas about physical reality with phenomena such as entanglement, & (ii)
More informationDecoherence and the Classical Limit
Chapter 26 Decoherence and the Classical Limit 26.1 Introduction Classical mechanics deals with objects which have a precise location and move in a deterministic way as a function of time. By contrast,
More informationfrom Euclid to Einstein
WorkBook 2. Space from Euclid to Einstein Roy McWeeny Professore Emerito di Chimica Teorica, Università di Pisa, Pisa (Italy) A Pari New Learning Publication Book 2 in the Series WorkBooks in Science (Last
More informationInfinity: is the universe infinite? Peter J. Cameron School of Mathematics and Statistics University of St Andrews
Infinity: is the universe infinite? Peter J Cameron School of Mathematics and Statistics University of St Andrews The Library of Babel The influential Argentine writer Jorge Luis Borges was fascinated
More informationMACHINE COMPUTING. the limitations
MACHINE COMPUTING the limitations human computing stealing brain cycles of the masses word recognition: to digitize all printed writing language education: to translate web content games with a purpose
More informationCSCI3390-Lecture 14: The class NP
CSCI3390-Lecture 14: The class NP 1 Problems and Witnesses All of the decision problems described below have the form: Is there a solution to X? where X is the given problem instance. If the instance is
More informationStochastic Processes
qmc082.tex. Version of 30 September 2010. Lecture Notes on Quantum Mechanics No. 8 R. B. Griffiths References: Stochastic Processes CQT = R. B. Griffiths, Consistent Quantum Theory (Cambridge, 2002) DeGroot
More informationFoundations of
91.304 Foundations of (Theoretical) Computer Science Chapter 3 Lecture Notes (Section 3.2: Variants of Turing Machines) David Martin dm@cs.uml.edu With some modifications by Prof. Karen Daniels, Fall 2012
More informationUnderstanding Decimal Addition
2 Understanding Decimal Addition 2.1 Experience Versus Understanding This book is about understanding system architecture in a quick and clean way: no black art, nothing you can only get a feeling for
More informationDecoding Reality The Universe as Quantum Information
Decoding Reality The Universe as Quantum Information Vlatko Vedral University of Oxford and National University of Singapore vlatko.vedral@qubit.org Universe as Information The Universe is fundamentally
More informationModels. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation
Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of
More informationLecture 25: Cook s Theorem (1997) Steven Skiena. skiena
Lecture 25: Cook s Theorem (1997) Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Prove that Hamiltonian Path is NP
More informationComputability and Complexity
Computability and Complexity Decidability, Undecidability and Reducibility; Codes, Algorithms and Languages CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario,
More informationCOMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE
Volume 3, No. 5, May 2012 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Tirtharaj Dash
More informationSpace Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1
Space Complexity Consider a k-string TM M with input x. Assume non- is never written over by. a The purpose is not to artificially reduce the space needs (see below). If M halts in configuration (H, w
More informationWhat Is Classical Physics?
Lecture : The Nature of Classical Physics Somewhere in Steinbeck country two tired men sit down at the side of the road. Lenny combs his beard with his fingers and says, Tell me about the laws of physics,
More informationThe space complexity of a standard Turing machine. The space complexity of a nondeterministic Turing machine
298 8. Space Complexity The space complexity of a standard Turing machine M = (Q,,,, q 0, accept, reject) on input w is space M (w) = max{ uav : q 0 w M u q av, q Q, u, a, v * } The space complexity of
More informationTuring Machines (TM) The Turing machine is the ultimate model of computation.
TURING MACHINES Turing Machines (TM) The Turing machine is the ultimate model of computation. Alan Turing (92 954), British mathematician/engineer and one of the most influential scientists of the last
More informationTheory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death
Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory
More informationQUANTUM COMPUTER SIMULATION
Chapter 2 QUANTUM COMPUTER SIMULATION Chapter 1 discussed quantum computing in non-technical terms and in reference to simple, idealized physical models. In this chapter we make the underlying mathematics
More informationThe purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational
1 The purpose here is to classify computational problems according to their complexity. For that purpose we need first to agree on a computational model. We'll remind you what a Turing machine is --- you
More informationRedundant Information and the Quantum-Classical Transition
University of California, Santa Barbara 22 August 2012 Redundant Information and the Quantum-Classical Transition C. Jess Riedel Acting advisor: Wojciech H. Zurek Theoretical Division Los Alamos National
More informationEntanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen
Entanglement arnoldzwicky.org Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen PHYS403, July 26, 2017 Entanglement A quantum object can
More informationInformation Entropy Theory of Physics
Information Entropy Theory of Physics Abstract... 1 Considering the chess game as a model of physics... 1 Using this model in physics... 4 Quantum Information Science... 4 Quantum Computing Research...
More informationCSCI3390-Assignment 2 Solutions
CSCI3390-Assignment 2 Solutions due February 3, 2016 1 TMs for Deciding Languages Write the specification of a Turing machine recognizing one of the following three languages. Do one of these problems.
More informationHomework. Turing Machines. Announcements. Plan for today. Now our picture looks like. Languages
Homework s TM Variants and the Universal TM Homework #6 returned Homework #7 due today Homework #8 (the LAST homework!) Page 262 -- Exercise 10 (build with JFLAP) Page 270 -- Exercise 2 Page 282 -- Exercise
More informationQuantum Information Types
qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction
More informationTuring Machines. Lecture 8
Turing Machines Lecture 8 1 Course Trajectory We will see algorithms, what can be done. But what cannot be done? 2 Computation Problem: To compute a function F that maps each input (a string) to an output
More informationCOMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
More informationFinal Exam Comments. UVa - cs302: Theory of Computation Spring < Total
UVa - cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95-102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,
More informationLooking at Scripture with New Eyes: A Chance Conversation Between Faith and Science
1 Looking at Scripture with New Eyes: A Chance Conversation Between Faith and Science William K. Lewis Fairmont Presbyterian Church College Ministry Team One of the things I really enjoy about education
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationComputation. Some history...
Computation Motivating questions: What does computation mean? What are the similarities and differences between computation in computers and in natural systems? What are the limits of computation? Are
More informationComplexity Theory. Ahto Buldas. Introduction September 10, Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach.
Introduction September 10, 2009 Complexity Theory Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas e-mail: Ahto.Buldas@ut.ee home: http://home.cyber.ee/ahtbu phone:
More informationde Blanc, Peter Ontological Crises in Artificial Agents Value Systems. The Singularity Institute, San Francisco, CA, May 19.
MIRI MACHINE INTELLIGENCE RESEARCH INSTITUTE Ontological Crises in Artificial Agents Value Systems Peter de Blanc Machine Intelligence Research Institute Abstract Decision-theoretic agents predict and
More informationCourse 395: Machine Learning
Course 395: Machine Learning Lecturers: Maja Pantic (maja@doc.ic.ac.uk) Stavros Petridis (sp104@doc.ic.ac.uk) Goal (Lectures): To present basic theoretical concepts and key algorithms that form the core
More informationLimits of Computation
The real danger is not that computers will begin to think like men, but that men will begin to think like computers Limits of Computation - Sydney J. Harris What makes you believe now that I am just talking
More informationCosmology Lecture 2 Mr. Kiledjian
Cosmology Lecture 2 Mr. Kiledjian Lecture 2: Quantum Mechanics & Its Different Views and Interpretations a) The story of quantum mechanics begins in the 19 th century as the physicists of that day were
More informationIntroduction: Computer Science is a cluster of related scientific and engineering disciplines concerned with the study and application of computations. These disciplines range from the pure and basic scientific
More informationALBERT EINSTEIN AND THE FABRIC OF TIME by Gevin Giorbran
ALBERT EINSTEIN AND THE FABRIC OF TIME by Gevin Giorbran Surprising as it may be to most non-scientists and even to some scientists, Albert Einstein concluded in his later years that the past, present,
More informationQuantum Computation via Sparse Distributed Representation
1 Quantum Computation via Sparse Distributed Representation Gerard J. Rinkus* ABSTRACT Quantum superposition states that any physical system simultaneously exists in all of its possible states, the number
More informationBefore We Start. The Pumping Lemma. Languages. Context Free Languages. Plan for today. Now our picture looks like. Any questions?
Before We Start The Pumping Lemma Any questions? The Lemma & Decision/ Languages Future Exam Question What is a language? What is a class of languages? Context Free Languages Context Free Languages(CFL)
More informationComplexity Classes in Membrane Computing
Complexity Classes in Membrane Computing Fernando Sancho Caparrini Research Group on Natural Computing Dpt. Computer Science and Artificial Intelligence University of Seville, Spain Goal Main Object of
More informationDynamical Embodiments of Computation in Cognitive Processes James P. Crutcheld Physics Department, University of California, Berkeley, CA a
Dynamical Embodiments of Computation in Cognitive Processes James P. Crutcheld Physics Department, University of California, Berkeley, CA 94720-7300 and Santa Fe Institute, 1399 Hyde Park Road, Santa Fe,
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. April 18/ May 2, 2016 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationIt From Bit Or Bit From Us?
It From Bit Or Bit From Us? Majid Karimi Research Group on Foundations of Quantum Theory and Information Department of Chemistry, Sharif University of Technology On its 125 th anniversary, July 1 st, 2005
More informationLimits of Computation. Antonina Kolokolova
Limits of Computation Antonina Kolokolova What is computation? What is information? What is learning? Are there any limits of our ability to solve problems? Theoretical Computer Science Is there a perfect
More informationLecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
More informationTuring s 1935: my guess about his intellectual journey to On Co
Turing s 1935: my guess about his intellectual journey to On Computable Numbers Dept. of Computer Science & Engineering Seoul National University 7/11/2017 @ The 15th Asian Logic Conference, Daejeon Turing
More informationTHE NATURE OF THERMODYNAMIC ENTROPY. 1 Introduction. James A. Putnam. 1.1 New Definitions for Mass and Force. Author of
THE NATURE OF THERMODYNAMIC ENTROPY James A. Putnam Author of http://newphysicstheory.com james@newphysicstheory.com Thermodynamic entropy is a pathway for transitioning from the mechanical world of fundamental
More informationLecture 8: Wave-Particle Duality. Lecture 8, p 2
We choose to examine a phenomenon which is impossible, absolutely impossible, to explain in any classical way, and which has in it the heart of quantum mechanics. In reality, it contains the only mystery.
More informationAnnouncements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.
Turing Machines Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing machine
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. May 11/13, 2015 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationQuantum Computation, NP-Completeness and physical reality [1] [2] [3]
Quantum Computation, NP-Completeness and physical reality [1] [2] [3] Compiled by Saman Zarandioon samanz@rutgers.edu 1 Introduction The NP versus P question is one of the most fundamental questions in
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018 Lecture 15 Ana Bove May 17th 2018 Recap: Context-free Languages Chomsky hierarchy: Regular languages are also context-free; Pumping lemma
More informationLecture 1: Course Overview and Turing machine complexity
CSE 531: Computational Complexity I Winter 2016 Lecture 1: Course Overview and Turing machine complexity January 6, 2016 Lecturer: Paul Beame Scribe: Paul Beame 1 Course Outline 1. Basic properties of
More informationO1 History of Mathematics Lecture VIII Establishing rigorous thinking in analysis. Monday 30th October 2017 (Week 4)
O1 History of Mathematics Lecture VIII Establishing rigorous thinking in analysis Monday 30th October 2017 (Week 4) Summary French institutions Fourier series Early-19th-century rigour Limits, continuity,
More informationUndecidable Problems and Reducibility
University of Georgia Fall 2014 Reducibility We show a problem decidable/undecidable by reducing it to another problem. One type of reduction: mapping reduction. Definition Let A, B be languages over Σ.
More informationThermodynamics of computation.
Thermodynamics of computation. Dominique Chu School of Computing University of Kent, UK D.F.Chu@kent.ac.uk C 3 Symposium December 11, 2017 Outline 1 Computation and Life itself 2 Living computers 3 Energy
More informationDecidable Languages - relationship with other classes.
CSE2001, Fall 2006 1 Last time we saw some examples of decidable languages (or, solvable problems). Today we will start by looking at the relationship between the decidable languages, and the regular and
More informationQuantum Computing and the Possible Effects on Modern Security Practices
Quantum Computing and the Possible Effects on Modern Security Practices SE 4C03 Winter 2005 Kartik Sivaramakrishnan Researched by: Jeffery Lindner, 9904294 Due: April 04, 2005 Table of Contents Introduction...
More informationHardy s Paradox. Chapter Introduction
Chapter 25 Hardy s Paradox 25.1 Introduction Hardy s paradox resembles the Bohm version of the Einstein-Podolsky-Rosen paradox, discussed in Chs. 23 and 24, in that it involves two correlated particles,
More informationCOMPUTATIONAL COMPLEXITY
ATHEATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Computational Complexity - Osamu Watanabe COPUTATIONAL COPLEXITY Osamu Watanabe Tokyo Institute of Technology, Tokyo, Japan Keywords: {deterministic, randomized,
More informationA short and personal introduction to the formalism of Quantum Mechanics
A short and personal introduction to the formalism of Quantum Mechanics Roy Freeman version: August 17, 2009 1 QM Intro 2 1 Quantum Mechanics The word quantum is Latin for how great or how much. In quantum
More informationarxiv:quant-ph/ v1 28 May 1998
Is There a Universal Quantum Computer? Yu Shi Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK (submitted on 25 May 1998) arxiv:quant-ph/9805083v1 28 May 1998 Abstract There is a fatal mistake
More informationTuring Machines Part III
Turing Machines Part III Announcements Problem Set 6 due now. Problem Set 7 out, due Monday, March 4. Play around with Turing machines, their powers, and their limits. Some problems require Wednesday's
More informationTransmitting and Hiding Quantum Information
2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents
More informationPhysics, Time and Determinism
Physics, Time and Determinism M.P. Vaughan Free will and determinism Some definitions: 1. Free will is the capacity of an agent to chose a particular outcome 2. Determinism is the notion that all events
More informationOther Problems in Philosophy and Physics
384 Free Will: The Scandal in Philosophy Illusionism Determinism Hard Determinism Compatibilism Soft Determinism Hard Incompatibilism Impossibilism Valerian Model Soft Compatibilism Other Problems in Philosophy
More informationGriffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0
Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0 Turing Machines Now for a machine model of much greater power.
More informationQUANTUM GRAVITY AND QUANTUM ELECTRODYNAMICS
QUANTUM GRAVITY AND QUANTUM ELECTRODYNAMICS Andrzej Staruszkiewicz Marian Smoluchowski Institute of Physics, Jagellonian University, Reymonta 4, 30-059 Kraków, Poland e-mail: astar@th.if.uj.edu.pl (Received
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationQuantum Information Processing
Quantum Information Processing Jonathan Jones http://nmr.physics.ox.ac.uk/teaching The Information Age Communication Shannon Computation Turing Current approaches are essentially classical which is wrong
More informationCan ANYTHING Happen in an Open System?
Can ANYTHING Happen in an Open System? Granville Sewell Mathematics Dept. University of Texas El Paso The Mathematical Intelligencer 23 (2001), no. 4, 8-10 Copyright held by Springer Verlag, NY, LLC Critics
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationLecture 4. 1 Circuit Complexity. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 4 1 Circuit Complexity Circuits are directed, acyclic graphs where nodes are called gates and edges are called
More informationData Warehousing & Data Mining
13. Meta-Algorithms for Classification Data Warehousing & Data Mining Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13.
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationLight Be! based upon the work of the English physicist and ist Michael Faraday ( ), that a moving magnetic. fields produce electric
Electromagnetism is a fundamental force in the universe. It is the underlying reason for the way things work in the micro and macro realms. It is essential in applied technology (from microwave ovens to
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More information