Psychonomics: the ontology of psychology Psychonomics: The ontology of psychology.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

Geometry Chapter 2 Terms.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Lecture 2: Basic Information Theory TSBK01 Image Coding and Data Compression Jörgen Ahlberg Div. of Sensor Technology Swedish Defence Research Agency (FOI)
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
1 Chapter 2 The Digital World. 2 Digital Data Representation.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the five essential properties of an algorithm.
Summer 2011 Wednesday, 07/13. Formal Systems: The ELI System The ELI-system uses only three letters of the alphabet: E, L, I. It has a single axiom, EI,
1 Semantic Description of Programming languages. 2 Static versus Dynamic Semantics n Static Semantics represents legal forms of programs that cannot be.
Induction and Decision Trees. Artificial Intelligence The design and development of computer systems that exhibit intelligent behavior. What is intelligence?
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
CPSC 322 Introduction to Artificial Intelligence September 15, 2004.
Start of Presentation Mathematical Modeling of Physical Systems © Prof. Dr. François E. Cellier Electrical CircuitsI This lecture discusses the mathematical.
6/3/2015Andrew Frank1 Communication: Information Content Andrew U. Frank Geoinformation TU Vienna Overheads at:
CSE332: Data Abstractions Lecture 2: Math Review; Algorithm Analysis Dan Grossman Spring 2010.
CPSC 411, Fall 2008: Set 12 1 CPSC 411 Design and Analysis of Algorithms Set 12: Undecidability Prof. Jennifer Welch Fall 2008.
Fundamental limits in Information Theory Chapter 10 :
Where are the Semantics in the Semantic Web? Michael Ushold The Boeing Company.
Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Fall 2008.
1 Module 4: Formal Definition of Solvability Analysis of decision problems –Two types of inputs:yes inputs and no inputs –Language recognition problem.
Chapter 2 Data Types, Declarations, and Displays
Copyright © Cengage Learning. All rights reserved.
CPSC 322 Introduction to Artificial Intelligence September 10, 2004.
Introduction to Computers and Programming. Some definitions Algorithm: Algorithm: A procedure for solving a problem A procedure for solving a problem.
Lecture 3. Boolean Algebra, Logic Gates
Information Theory and Security
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Definition and Properties of the Production Function Lecture II.
An Introduction to Math 419: Probability & Statistics by Marty Spears.
Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
The problem of sampling error in psychological research We previously noted that sampling error is problematic in psychological research because differences.
Chapter 6: Normal Probability Distributions
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Copyright © Cengage Learning. All rights reserved. CHAPTER 11 ANALYSIS OF ALGORITHM EFFICIENCY ANALYSIS OF ALGORITHM EFFICIENCY.
CENG 311 Machine Representation/Numbers
Data vs. Information OUTPUTOUTPUT Information Data PROCESSPROCESS INPUTINPUT There are 10 types of people in this world those who read binary and those.
ECE 2300 Circuit Analysis Dr. Dave Shattuck Associate Professor, ECE Dept. Lecture Set #12 Natural Response W326-D3.
UNCLASSIFIED 1 Top 3 M&S Challenges for SSTR Operations Developing Epistemologically Sound Standards for Analysis Developing Adequate Technology to Represent.
Computational Intelligence: Methods and Applications Lecture 31 Combinatorial reasoning, or learning from partial observations. Włodzisław Duch Dept. of.
Foundations of Computer Science Computing …it is all about Data Representation, Storage, Processing, and Communication of Data 10/4/20151CS 112 – Foundations.
1 Chapter 1 Automata: the Methods & the Madness Angkor Wat, Cambodia.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Inference Rules and Proofs (Z); Program Specification and Verification Inference Rules and Proofs (Z); Program Specification and Verification.
Introduction to CS Theory Lecture 3 – Regular Languages Piotr Faliszewski
Unit 2 – Week 4 Reasoning with Linear Equations and Inequalities Lesson 3 Students are introduced to the formal process of solving an equation: starting.
Channel Capacity.
Formal Models in AGI Research Pei Wang Temple University Philadelphia, USA.
1 Knowledge Representation. 2 Definitions Knowledge Base Knowledge Base A set of representations of facts about the world. A set of representations of.
UNCERTML - DESCRIBING AND COMMUNICATING UNCERTAINTY WITHIN THE (SEMANTIC) WEB Matthew Williams
Set A formal collection of objects, which can be anything May be finite or infinite Can be defined by: – Listing the elements – Drawing a picture – Writing.
Chapter 5: Sequences, Mathematical Induction, and Recursion 5.9 General Recursive Definitions and Structural Induction 1 Erickson.
MA/CSSE 474 Theory of Computation Decision Problems DFSMs.
Machine Learning Chapter 5. Artificial IntelligenceChapter 52 Learning 1. Rote learning rote( โรท ) n. วิถีทาง, ทางเดิน, วิธีการตามปกติ, (by rote จากความทรงจำ.
Computation & Machine, Ancient to Modern Review
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
Binary System Presented by Mr. Wilhelmi Internal Representation of Data Input Input  Data that is put into the computer for processing Data Data  The.
Copyright © Cengage Learning. All rights reserved. Line and Angle Relationships 1 1 Chapter.
Overview of the theory of computation Episode 3 0 Turing machines The traditional concepts of computability, decidability and recursive enumerability.
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
CIS Automata and Formal Languages – Pei Wang
L-systems L-systems are grammatical systems introduced by Lyndenmayer to describe biological developments such as the growth of plants and cellular organisms.
Deterministic FA/ PDA Sequential Machine Theory Prof. K. J. Hintz
BEE1244 Digital System and Electronics BEE1244 Digital System and Electronic Chapter 2 Number Systems.
BINARY SYSTEM.
Objective of This Course
CPSC 322 Introduction to Artificial Intelligence
Copyright © Cengage Learning. All rights reserved.
CMSC250 Fall 2018 Circuits 1 1.
Generalized Diagnostics with the Non-Axiomatic Reasoning System (NARS)
Presentation transcript:

Psychonomics: the ontology of psychology Psychonomics: The ontology of psychology

Psychonomics: the ontology of psychology Overview What is information? Where does it come from? How do we recognize and measure it? What is information processing? –What is a rule?

Psychonomics: the ontology of psychology What really exists? What does it mean to ‘really’exist” Consider the binary digit: What is it? –An integer –A real number –A color –A Japanese character –A date –A memory location How can we tell the difference between a new notation or representation and a new fact or object?

Psychonomics: the ontology of psychology What is information? Three related definitions: i.) Claude Shannon / Norbert Wiener: Reduction in uncertainty ii.) Greg Chaitlin: The shortest representation (= elimination of redundancy) iii.) Gregory Bateson: Differences that make a difference

Psychonomics: the ontology of psychology i.) Claude Shannon / Norbert Wiener: Information as reduction in uncertainty defined information as the negative condition (opposite) of the statistical properties of uncertainty in thermodynamic gases their equation defines information in terms of the number of decisions that must be made in order to change uncertainty to certainty

Psychonomics: the ontology of psychology i.) Claude Shannon / Norbert Wiener: Information as reduction in uncertainty information = the number of decisions that must be made in order to change uncertainty into certainty –In general, this is a log function of the number of items: that is, each reduction takes away the same proportion of remaining uncertainty (usually half) –Example: How much information is in the alphabet? Hint: Ask someone to think of a letter and play 20 questions You need at most 5 questions, so the answer is about 5 bits of information (log2(26) = 4.7)

Psychonomics: the ontology of psychology ii.) Greg Chaitin: Information = the shortest representation Clever people can, in some situations, ask better questions –an entity is said to contain as much information as can be contained in the shortest computer program (in a well- defined way) that can produce that entity –that program is essentially equivalent to a description of that information –Note the notion of elimination of redundancy = an emphasis on the BEST representation as a measure of information content. Q: What does this say about random data sets?

Psychonomics: the ontology of psychology iii.) Gregory Bateson: Information = Differences that make a difference One person’s information is another person’s irrelevancy –For example, you will ignore the top bits of a byte if you don’t need them: so you compress any number of irrelevant bits (including random bits) down to 0 - In biological systems- in human psychology- we have to ask: What does these bits mean? information is a difference that makes a difference What makes a difference to an individual depends on what that individual wants to do; his/her motivation and/or interests

Psychonomics: the ontology of psychology Information and meaning are aligned, but in different worlds. –Information allows meaning, but it does not specify meaning. –Information:meaning :: soil:plants - they allow growth, but don’t have anything to say about what will grow... What humans crave is meaning. What the world offers us is information.

Psychonomics: the ontology of psychology Where does information come from? Along with observation, we have three ways to get information: 1.) By deduction: Drawing a conclusion from a principle already known or assumed; reasoning from generals to particulars 2.) By induction : Deriving a general principle from the observation of particular instances 3.) By abduction : Deriving a general principle when the major premiss is certain, and the minor only probable

Psychonomics: the ontology of psychology What is information processing? Note that all three techniques take as input: information –Information comes from manipulating information –We manipulate information by applying transformation rules to it

Psychonomics: the ontology of psychology What is a rule? We manipulate information by applying transformation rules There are two kinds of rules: i.) Rules for determining type: What is this X? ii.) Rules for transforming (= computing across) specified types (known as ‘methods’): What I can I do with X? What can X do for me? Why does X make a difference?

Psychonomics: the ontology of psychology What is a formal system? i.) Assumptions: An explicit and finite list of axioms- without which, nothing. ii.) Symbols: An explicit and finite list of symbols- without which, nothing to systematize iii.) Rules: An explicit and finite list of rules for determining grammaticality- without which, gibberish iv.) Methods: An explicit and finite list of steps of transformation- without which, chaos.

Psychonomics: the ontology of psychology What is a formal system? Logic, geometry, computer languages, statistical methods ARE formal systems Thermostats, electrical devices, & other deterministic machines can be described by formal systems because they have a strong mapping with formal systems. Our 431 questions are: What else can be described in formal terms? How much of the observable variability in humans can be captured in terms of the four components of a formal system? Of what can human psychology speak? Of what must it remain silent?

Psychonomics: the ontology of psychology Questions Why do we only want to speak of entities that fall under formal systems? What is gain/lost by this? How is ‘kindness’ different from ‘wood’? –Is ‘kindness’ more or less ‘real’ than ‘wood’? Why? –Is ‘kindness’ more or less real than ‘intelligence’? Why? Should we include moral axioms in our list of axioms defining what we can do in our system(s)? Why or why not?