Proof Planning as Understanding as Cortical Functions Brendan Juba With Manuel Blum Matt Humphrey Ryan Williams.

Slides:



Advertisements
Similar presentations
Correlation Search in Graph Databases Yiping Ke James Cheng Wilfred Ng Presented By Phani Yarlagadda.
Advertisements

Characteristics of a Linear System 2.7. Topics Memory Invertibility Inverse of a System Causality Stability Time Invariance Linearity.
Arithmetic Coding. Gabriele Monfardini - Corso di Basi di Dati Multimediali a.a How we can do better than Huffman? - I As we have seen, the.
Lecture # 2 : Process Models
Software Process Models
Universal Communication Brendan Juba (MIT) With: Madhu Sudan (MIT)
Pattern Analysis Prof. Bennett Math Model of Learning and Discovery 2/14/05 Based on Chapter 1 of Shawe-Taylor and Cristianini.
Quantum Spectrum Testing Ryan O’Donnell John Wright (CMU)
CSE 425: Logic Programming I Logic and Programs Most programs use Boolean expressions over data Logic statements can express program semantics –I.e., axiomatic.
Embedded System Lab Kim Jong Hwi Chonbuk National University Introduction to Intelligent Robots.
Proof Clustering for Proof Plans Matt Humphrey Working with: Manuel Blum Brendan Juba Ryan Williams.
1 Lecture 14 Language class LFSA –Study limits of what can be done with FSA’s –Closure Properties –Comparing to other language classes.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
10 top tips to manage your essay Start early Find out marking criteria Understand the question Organise your thoughts, ideas and information Create outline.
Analysis Stage (Phase I) The goal: understanding the customer's requirements for a software system. n involves technical staff working with customers n.
Introduction to Computers and Programming. Some definitions Algorithm: –A procedure for solving a problem –A sequence of discrete steps that defines such.
Requirements Analysis Concepts & Principles
1 Lecture 18 Closure Properties of Language class LFSA –Remember ideas used in solvable languages unit –Set complement –Set intersection, union, difference,
Manuel Blum Ryan Williams Brendan Juba Matt Humphrey 13 June 2005 TOWARD A HIGH-LEVEL DEFINITION OF CONSCIOUSNESS.
Finding Bit Patterns Applying haplotype models to association study design Natalie Castellana Kedar Dhamdhere Russell Schwartz August 16, 2005.
Parameterizing Random Test Data According to Equivalence Classes Chris Murphy, Gail Kaiser, Marta Arias Columbia University.
Math Journal 9-5 Evaluate Simplify
Manuel Blum Ryan Williams Brendan Juba Matt Humphrey 13 June 2005 TOWARD A HIGH-LEVEL DEFINITION OF CONSCIOUSNESS.
Hardness Results for Problems P: Class of “easy to solve” problems Absolute hardness results Relative hardness results –Reduction technique.
Hardness Results for Problems
A Recap of Proof Planning and “Hawkins Neuroscience 101” Matt Humphrey Working with: Manuel Blum Brendan Juba Ryan Williams.
Design and Analysis of Algorithms
The Fundamentals: Algorithms, the Integers & Matrices.
Chapter Seven Advanced Shell Programming. 2 Lesson A Developing a Fully Featured Program.
Aurora: A Conceptual Model for Web-content Adaptation to Support the Universal Accessibility of Web-based Services Anita W. Huang, Neel Sundaresan Presented.
ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
1 Section 5.5 Solving Recurrences Any recursively defined function ƒ with domain N that computes numbers is called a recurrence or recurrence relation.
Quick Flip Questioning for Critical Thinking Kobets S.A. Lyceum №87.
1 Software Reliability Assurance for Real-time Systems Joel Henry, Ph.D. University of Montana NASA Software Assurance Symposium September 4, 2002.
Framework for the Development and Testing of Dependable and Safety-Critical Systems IKTA 065/ Supported by the Information and Communication.
A New Theory of Neocortex and Its Implications for Machine Intelligence TTI/Vanguard, All that Data February 9, 2005 Jeff Hawkins Director The Redwood.
Parallel and Distributed Simulation Introduction and Motivation.
1 Limits of Learning-based Signature Generation with Adversaries Shobha Venkataraman, Carnegie Mellon University Avrim Blum, Carnegie Mellon University.
Introduction to Problem Solving. Steps in Programming A Very Simplified Picture –Problem Definition & Analysis – High Level Strategy for a solution –Arriving.
LEARNING DOMAINS & OBJECTIVES Southern Illinois University Carbondale Instructor Workshop.
1 Building The Ultimate Consistent Reader. 2 Introduction We’ve already built a consistent reader (cube-Vs.-point)... Except it had variables ranging.
Type your question here. Type Answer Type your question here. Type Answer.
KAMI KITT ASSISTIVE TECHNOLOGY Chapter 7 Human/ Assistive Technology Interface.
Computational Learning Theory IntroductionIntroduction The PAC Learning FrameworkThe PAC Learning Framework Finite Hypothesis SpacesFinite Hypothesis Spaces.
Math – What is a Function? 1. 2 input output function.
CSC310 © Tom Briggs Shippensburg University Fundamentals of the Analysis of Algorithm Efficiency Chapter 2.
Intelligent Agent Framework1 From Chapter 7 of Constructing Intelligent Agents with Java.
Fall 2006CS 395: Computer Security1 Confidentiality Using Symmetric Encryption.
Problem solving in control of discrete-event systems Lenko Grigorov and Karen Rudie Queen’s University Kingston, Canada.
Reinforcement Learning AI – Week 22 Sub-symbolic AI Two: An Introduction to Reinforcement Learning Lee McCluskey, room 3/10
 Description of Inheritance  Base Class Object  Subclass, Subtype, and Substitutability  Forms of Inheritance  Modifiers and Inheritance  The Benefits.
PROGRAMMING FUNDAMENTALS INTRODUCTION TO PROGRAMMING. Computer Programming Concepts. Flowchart. Structured Programming Design. Implementation Documentation.
SIUC Instructor Workshop Learning Domains and Objectives.
(Proof By) Induction Recursion
Week 2 PSA 1C Would you say that systems that have higher efficiency ratios than other systems will always have higher utilization ratios than those.
CS 154, Lecture 6: Communication Complexity
Local Error-Detection and Error-correction
The Big Picture Why we’re really interested in clustering proofs of theorems Manuel Blum, Matt Humphrey, Brendan Juba, Ryan Williams.
What are the 3 chords we have learnt so far?
Experimental Design: The Scientific Method.
Proof Planning as Understanding as Cortical Functions
Greedy Algorithms / Caching Problem Yin Tat Lee
Where Do New Products and Services Come From?
Equivalence We have already introduced the idea of equivalence
Discrete Mathematics 7th edition, 2009
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 17 (2005) Richard Cleve DC 3524
Pattern Analysis Prof. Bennett
Presentation transcript:

Proof Planning as Understanding as Cortical Functions Brendan Juba With Manuel Blum Matt Humphrey Ryan Williams

2 WHAT and WHY WANTED: proof-clustering algorithm –Characterizes high-level idea –Aid theorem-provers WANTED: define CONSCSness –Aid in answering fundamental questions –Basis for developing protocols –Directing development of robots, etc.

3 CONTENTS NO algorithms –– INSTEAD: –Where to discover an algorithm Viewing neocortex as a proof planner –Why expect suitability Link to understanding

4 Proof Planning in the Memory- Prediction Framework Suppose Alice is studying proofs… Under the Framework: –Regions of cortex representing proof steps switch on in sequence –Hierarchically higher regions form “names” “names” and “names of patterns of names” –Alice can recall the patterns later Patterns serve as proof plans (more…)

5 Patterns serve as proof plans? Proof plan: –Generates sequence of proof steps –Features: Expectancy Generality Satisfied by named patterns in cortex –Proof steps encoded in lower regions

6 Where’s the algorithm? Critical link between cortical regions –Cortical region forms name for an input pattern –Translated: forms proof plan from pattern of already-formed proof plans –Our algorithm! Presently: not understood.

7 Proof Planning and the Cortical Algorithms Conservative learning algorithm  lower bounds – Proof Planning: restricted domain Decoded cortical algorithms  system for learning and utilizing proof plans – “But, is it any good?”

8 YOU ARE HERE CONTENTS –Where to discover an algorithm Viewing neocortex as a proof planner –Why expect suitability  Link to understanding

9 Understanding in the Memory- Prediction Framework

10 Understanding as Proof Plans Share several characteristics Identifying a proof plan permits –Prediction –Correction of “minor” mistakes –Re-use of ideas and/or techniques –Generation of summaries

11 Ideal Proof Plans Goals of proof-planning –Mimic human theorem-proving –Produce human-oriented output Goal for CONSCS –Characterize high-level ideas

12 Directions for Future Work 1.Decipher cortical algorithms!! 2.Automate learning of proof plans 3.Analyze cortical functions 4.Refine definitions for CONSCS