Notes on Information, Reference, and Machine Thirdness

Size: px
Start display at page:

Download "Notes on Information, Reference, and Machine Thirdness"

Transcription

1 Notes on Information, Reference, and Machine Thirdness Rafael Alvarado Data Science Institute Human & Machine Intelligence Group Humanities Informatics Lab 24 July 2018

2 Overview Paul proposes that neural networks (ANNs) may be characterized by their capacity to preserve referential content. Where refence and representation are to be understood to be independent of human cognition. I propose that to explore this idea entails a broad project to combine semiotics and information theory in order to provide a suitable theory of reference. Since reference is an element of semiotics, and we want to measure referential content preservation.

3 Overview Specifically, we want to use information theory to develop a non-semantic theory of reference. This project appears doomed, since information theory (Shannon 19848) begins by separating semantics from information, and reference is central to semantics. Reference and information ought to have nothing to do with each other. However, this limitation may be more apparent than real. It follows from our confused usage of the term information, and an ossified understanding of reference.

4 Four Meanings of Information 1. Instruction Both verb and noun. Rooted in metaphysics of form and matter. Roman and Medieval usage. Advice, education. 2. News Both Austen information (private) and content of newspapers (public). Particular, actionable, time-sensitive, remote knowledge. 3. Entropy See Shannon (1948). A measurable property of messages. Bell Labs solution to engineering problem with telegraphs, etc. 4. Form See Bateson (1970) Form, Substance, and Difference. Information travels from the wood and paper into my retina. It then gets picked up and worked on by this fancy piece of computing machinery in my head. Associated with the English school of information theory.

5 The four meanings are related both historically and conceptually. For our purposes, we want to focus on information as entropy but not lose its connection to information as form. Even given the narrow definition of Shannon, the grammar of the word is confused.

6 Usages of Shannon Information 1. As entropy: The more information, the less determinate the output of a random process (i.e. more choices for prediction). Information as uncertainty. 2. As reduction of entropy: Implied by information gain. The more information we gain, the more determinate the random process (i.e. fewer choices). Information as certainty. 3. As the bit, the elementary unit of information: No reference at all to entropy or certainty. Information is just the sum of bits in a container (e.g. a hard drive or newspaper). Effectively refers to the space in a sequence that can hold a bit. Entropy measured in bits, therefore information is prior to entropy.

7 The mathematical formulae used to define the bit, entropy, relative entropy, and mutual information (Cover 2006), are coherent, indeed elegant, but the language we use to describe the phenomena they treat is incoherent. Distance, time, and mass do not have these issues. We are very clear about their magnitudes and units. More is more, less is less.

8 Proposed Definitions Bit A member of the smallest possible alphabet (e.g. 0 and 1). Occupies a single space in a sequence. Not a number of per se, but can be treated as one. Sequences of bits are messages. Entropy The irreducible complexity of a random process (Cover). Measured in bits. Inferred through, but not identical to, proxies, such as optimal length of output messages. Information Proportional to the inverse of entropy. Thus, more information means more certainty about a process.

9 Benefits of this Definition of Information Information is not simply a variant way of representing entropy; the inverse of entropy is an index of form and pattern, which is interestingly related to the concept of complexity (Cover and Thomas 2006 [1990]: 1). Sequence is a kind of pattern that lends itself to analysis. The relationship of pattern to complexity remains to be explicated. Also, in this definition, information flows throughout a system. Finally, allows us to say things like a well-trained neural network is literally a well-informed neural network. We are back to learning as informing...

10 Conjectures about Information Shannon information is a property of messages. The outputs of random processes are always represented as messages, which are sequences of (so-called) symbols drawn from a so-called alphabet, even when these outputs manifest as continuous signals from non-human sources. Information is physical but not material. It can be measured, but has neither mass nor energy. See Wiener s principle: Information is information, not matter or energy. No materialism which does not admit this can survive at the present day. (1948: 132) Inescapable hylomorphism!

11 thirdness C A firstness B secondness

12 Reference A stands for B A: vehicle, B: target stands for means 1 refers to denotes is a (name sign symbol ) of Always implicitly to someone (a mind) A stands for B to C C makes (and stores) the connection between A and B Peirce s thirdness Always asymmetric A B B A A is a substitute for B

13 Conjectures about Asymmetry Asymmetry is hierarchical. A sign points from the plane of signs to another plane of referents, which may be images or other signs. Asymmetry is a requirement to make inferences about B from A. We make inferences about B by manipulating A. Signs are used to model the relationships between things. Asymmetry is required to communicate about B in its absence. Signs are required to have thoughts about things that are not present. Referential relationships collectively form a directed graph of references. That is, references participate in semantic graphs.

14 The asymmetry of reference implies thirdness. Firstness and secondness are sufficient to describe mere associations, but thirdness implies a plane of inference in which signs can be connected into propositional networks comprising analytic and synthetic statements. IOW, reference implies inference.

15 This characterization implies a distinction between deictic and logical reference. Deictic reference involves signs from the plane of inference pointing to entities outside of this plane (so-called things ). Logical reference involves signs within the plane pointing to each other, by means of propositional forms ( A is B ) to form chains of inference.

16 Thirdness Most theorists of reference agree that the referential relationship is always constructed by means of thirdness. Ogden and Richards called this thought. Saussure conceived of this as a system of differences. Frege s Sinn, translated as Sense, occupies this space. Connotations, which derive from the association of a word with other words, may be said to occupy this space as well. Kant s transcendental unity of apperception goes here. In fact, thirdness is something of a black box whose contents are characterized by various theorists.

17 Note that there is room in the concept of thirdness to accommodate variability in planes of inference, i.e. modes of rationality such as logical, so-called pre-logical, nonconscious, etc.

18 A Non-Semantic Theory of Reference First, eliminate requirement of asymmetry. Reference without asymmetry is association. Associations are of two kinds: by contiguity or similarity. Hume posits causality, but this is actually a kind of contiguity (in time). Then, recover thirdness through application of information theory to associations. An a posteriori analytic approach to reference. Reference is in fact built on top of association: these are motivations for reference, which is always conventional (thirdness)

19 Machine Thirdness We know that associations may be generated mechanically through the application of information theory. Contiguity informed by means of mutual information and association rules. Similarity informed by means of various distance measures (e.g. Euclidean, cosine, Jensen- Shannon divergence, Jaccard index, etc. See Tiel and Latour, 1995, The Hume Machine: Can Association Networks Do More Than Formal Rules? But what does mechanical thirdness look like? Do machines that learn contain anything like a plane of inference?

20 Information and Thirdness The question is, what is the relationship between thirdness and information? How does our definition of information help us to answer this question? Complexity? Look at work on opening the black box...

21 Neural Networks We know that ANNs trade model interpretability for predictive accuracy. Model interpretability is required to perform inference. It is important to note, however, that ANNs do generate models they are just enormously complex. In principle, these models form an inferential graph that occupies the place of thirdness in establishing the relationship between input variables (A) and output labels (B). Recently, an understanding of the structure of this black box has begun to emerge.

22 Neural Networks 1. Features and Labels 1. Predictor variables stand for labels. 2. Machines model this relationship through training. 2. Information Bottleneck (Tishby 2000) 1. First layers do memorization and basic recognition. 2. Last layers do compression and optimization. 3. Machine learns (is informed) by means of throwing out extraneous data not a simple mirroring as Hume would have it. 3. Transfer Learning 1. First layers discover common patterns. 2. Last layers are fine-tuning. 3. First layers can be inherited and locked (frozen).

23 Shwartz-Ziv, Ravid, and Naftali Tishby Opening the Black Box of Deep Neural Networks via Information. ArXiv: [Cs], March.

24 Geoffrey Hinton, a pioneer of deep learning who works at Google and the University of Toronto, ed Tishby after watching his Berlin talk. It s extremely interesting, Hinton wrote. I have to listen to it another 10,000 times to really understand it, but it s very rare nowadays to hear a talk with a really original idea in it that may be the answer to a really major puzzle. Wolchover, ByNatalie. n.d. New Theory Cracks Open the Black Box of Deep Learning. Quanta Magazine. Accessed July 24,

25 End

It From Bit Or Bit From Us?

It 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 information

An Ontology Diagram for Coordination of the Hylomorphically Treated Entities

An Ontology Diagram for Coordination of the Hylomorphically Treated Entities An Ontology Diagram for Coordination of the Hylomorphically Treated Entities Algirdas [0000-0001-6712-3521] Vilnius University, Vilnius, Universiteto g. 3, LT-01513, Lithuania algirdas.budrevicius@kf.vu.lt

More information

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not

More information

Lecture 15: Recurrent Neural Nets

Lecture 15: Recurrent Neural Nets Lecture 15: Recurrent Neural Nets Roger Grosse 1 Introduction Most of the prediction tasks we ve looked at have involved pretty simple kinds of outputs, such as real values or discrete categories. But

More information

A Mathematical Theory of Communication

A Mathematical Theory of Communication A Mathematical Theory of Communication Ben Eggers Abstract This paper defines information-theoretic entropy and proves some elementary results about it. Notably, we prove that given a few basic assumptions

More information

240 Metaphysics. Frege s Puzzle. Chapter 26

240 Metaphysics. Frege s Puzzle. Chapter 26 240 Metaphysics Frege s Puzzle Frege s Puzzle 241 Frege s Puzzle In his 1879 Begriffsschrift (or Concept-Writing ), Gottlob Frege developed a propositional calculus to determine the truth values of propositions

More information

The Evolution and Discovery of the Species of Equality in Euclid s Elements

The Evolution and Discovery of the Species of Equality in Euclid s Elements From the SelectedWorks of Lee T Nutini 2010 The Evolution and Discovery of the Species of Equality in Euclid s Elements Lee T Nutini Available at: https://works.bepress.com/nutini/2/ Nutini 1 The Evolution

More information

(Refer Slide Time: 0:21)

(Refer Slide Time: 0:21) Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata

More information

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC

CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC 1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of

More information

Logical Form, Mathematical Practice, and Frege s Begriffsschrift. Danielle Macbeth Haverford College

Logical Form, Mathematical Practice, and Frege s Begriffsschrift. Danielle Macbeth Haverford College Logical Form, Mathematical Practice, and Frege s Begriffsschrift Danielle Macbeth Haverford College Logic Colloquium 2015, Helsinki, August 3 8, 2015 Outline written mathematics report of reasoning display

More information

Scientific Explanation- Causation and Unification

Scientific Explanation- Causation and Unification Scientific Explanation- Causation and Unification By Wesley Salmon Analysis by Margarita Georgieva, PSTS student, number 0102458 Van Lochemstraat 9-17 7511 EG Enschede Final Paper for Philosophy of Science

More information

A non-turing-recognizable language

A non-turing-recognizable language CS 360: Introduction to the Theory of Computing John Watrous, University of Waterloo A non-turing-recognizable language 1 OVERVIEW Thus far in the course we have seen many examples of decidable languages

More information

CS:4420 Artificial Intelligence

CS:4420 Artificial Intelligence CS:4420 Artificial Intelligence Spring 2018 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart

More information

KB Agents and Propositional Logic

KB Agents and Propositional Logic Plan Knowledge-Based Agents Logics Propositional Logic KB Agents and Propositional Logic Announcements Assignment2 mailed out last week. Questions? Knowledge-Based Agents So far, what we ve done is look

More information

Philosophy of Mathematics Structuralism

Philosophy of Mathematics Structuralism Philosophy of Mathematics Structuralism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 17/11/15 Neo-Fregeanism Last week, we considered recent attempts to revive Fregean logicism. Analytic

More information

Stat Mech: Problems II

Stat Mech: Problems II Stat Mech: Problems II [2.1] A monatomic ideal gas in a piston is cycled around the path in the PV diagram in Fig. 3 Along leg a the gas cools at constant volume by connecting to a cold heat bath at a

More information

Information in Biology

Information in Biology Lecture 3: Information in Biology Tsvi Tlusty, tsvi@unist.ac.kr Living information is carried by molecular channels Living systems I. Self-replicating information processors Environment II. III. Evolve

More information

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms Philosophy 5340 Epistemology Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms Part 2: Theoretical Terms 1. What Apparatus Is Available for Carrying out Analyses?

More information

3F1 Information Theory, Lecture 1

3F1 Information Theory, Lecture 1 3F1 Information Theory, Lecture 1 Jossy Sayir Department of Engineering Michaelmas 2013, 22 November 2013 Organisation History Entropy Mutual Information 2 / 18 Course Organisation 4 lectures Course material:

More information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

de Blanc, Peter Ontological Crises in Artificial Agents Value Systems. The Singularity Institute, San Francisco, CA, May 19.

de 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 information

Information in Biology

Information in Biology Information in Biology CRI - Centre de Recherches Interdisciplinaires, Paris May 2012 Information processing is an essential part of Life. Thinking about it in quantitative terms may is useful. 1 Living

More information

On the Evolution of the Concept of Time

On the Evolution of the Concept of Time On the Evolution of the Concept of Time Berislav Žarnić Faculty of Humanities and Social Sciences Research Centre for Logic, Epistemology, and Philosophy of Science University of Split Physics & Philosophy

More information

Knowledge Representation. Propositional logic

Knowledge Representation. Propositional logic CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

Are Objects Ontologically Dependent on Processes?

Are Objects Ontologically Dependent on Processes? Are Objects Ontologically Dependent on Processes? Antony Galton Department of Computer Science University of Exeter, UK CAOS Symposium University of Bath 20 April 2017 Things vs Processes Traditional substance-based

More information

Simple Math: Cryptography

Simple Math: Cryptography 1 Introduction Simple Math: Cryptography This section develops some mathematics before getting to the application. The mathematics that I use involves simple facts from number theory. Number theory is

More information

Introduction to Information Theory. Uncertainty. Entropy. Surprisal. Joint entropy. Conditional entropy. Mutual information.

Introduction to Information Theory. Uncertainty. Entropy. Surprisal. Joint entropy. Conditional entropy. Mutual information. L65 Dept. of Linguistics, Indiana University Fall 205 Information theory answers two fundamental questions in communication theory: What is the ultimate data compression? What is the transmission rate

More information

Dept. of Linguistics, Indiana University Fall 2015

Dept. of Linguistics, Indiana University Fall 2015 L645 Dept. of Linguistics, Indiana University Fall 2015 1 / 28 Information theory answers two fundamental questions in communication theory: What is the ultimate data compression? What is the transmission

More information

3 The Semantics of the Propositional Calculus

3 The Semantics of the Propositional Calculus 3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical

More information

Knowledge, Truth, and Mathematics

Knowledge, Truth, and Mathematics Knowledge, Truth, and Mathematics Philosophy 405 Russell Marcus Hamilton College, Fall 2010 September 27 Class 9: Kant II Marcus, Knowledge, Truth, and Mathematics, Fall 2010 Slide 1 Necessity/Contingency

More information

The Turing machine model of computation

The Turing machine model of computation The Turing machine model of computation For most of the remainder of the course we will study the Turing machine model of computation, named after Alan Turing (1912 1954) who proposed the model in 1936.

More information

Sequences and Information

Sequences and Information Sequences and Information Rahul Siddharthan The Institute of Mathematical Sciences, Chennai, India http://www.imsc.res.in/ rsidd/ Facets 16, 04/07/2016 This box says something By looking at the symbols

More information

Logic Background (1A) Young W. Lim 12/14/15

Logic Background (1A) Young W. Lim 12/14/15 Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

More information

School of EECS Washington State University. Artificial Intelligence

School of EECS Washington State University. Artificial Intelligence School of EECS Washington State University 1 } Webpage: www.eecs.wsu.edu/~holder/courses/ai } Email (holder@wsu.edu) } Blackboard Learn (learn.wsu.edu) } mywsu (my.wsu.edu) 2 Readings: Chapter 1 3 } John

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of

More information

Knowledge Representation. Propositional logic.

Knowledge Representation. Propositional logic. CS 1571 Introduction to AI Lecture 10 Knowledge Representation. Propositional logic. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Announcements Homework assignment 3 due today Homework assignment

More information

ITCT Lecture IV.3: Markov Processes and Sources with Memory

ITCT Lecture IV.3: Markov Processes and Sources with Memory ITCT Lecture IV.3: Markov Processes and Sources with Memory 4. Markov Processes Thus far, we have been occupied with memoryless sources and channels. We must now turn our attention to sources with memory.

More information

Why the Difference Between Quantum and Classical Physics is Irrelevant to the Mind/Body Problem

Why the Difference Between Quantum and Classical Physics is Irrelevant to the Mind/Body Problem Why the Difference Between Quantum and Classical Physics is Irrelevant to the Mind/Body Problem Kirk Ludwig Department of Philosophy University of Florida Gainesville, FL 32611-8545 U.S.A. kludwig@phil.ufl.edu

More information

Ling 130 Notes: Syntax and Semantics of Propositional Logic

Ling 130 Notes: Syntax and Semantics of Propositional Logic Ling 130 Notes: Syntax and Semantics of Propositional Logic Sophia A. Malamud January 21, 2011 1 Preliminaries. Goals: Motivate propositional logic syntax and inferencing. Feel comfortable manipulating

More information

Relations. Carl Pollard. October 11, Department of Linguistics Ohio State University

Relations. Carl Pollard. October 11, Department of Linguistics Ohio State University Department of Linguistics Ohio State University October 11, 2011 (Intuitive Idea) Intuitively, a relation is the kind of thing that either holds or doesn t hold between certain things. Examples: Being

More information

Hi, my name is Dr. Ann Weaver of Argosy University. This WebEx is about something in statistics called z-

Hi, my name is Dr. Ann Weaver of Argosy University. This WebEx is about something in statistics called z- Hi, my name is Dr. Ann Weaver of Argosy University. This WebEx is about something in statistics called z- Scores. I have two purposes for this WebEx, one, I just want to show you how to use z-scores in

More information

Implicit Differentiation Applying Implicit Differentiation Applying Implicit Differentiation Page [1 of 5]

Implicit Differentiation Applying Implicit Differentiation Applying Implicit Differentiation Page [1 of 5] Page [1 of 5] The final frontier. This is it. This is our last chance to work together on doing some of these implicit differentiation questions. So, really this is the opportunity to really try these

More information

Announcements CompSci 102 Discrete Math for Computer Science

Announcements CompSci 102 Discrete Math for Computer Science Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most

More information

FACTORIZATION AND THE PRIMES

FACTORIZATION AND THE PRIMES I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary

More information

Grade 7/8 Math Circles November 27 & 28 &

Grade 7/8 Math Circles November 27 & 28 & Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 27 & 28 & 29 2018 Symmetry and Music Introduction We ve done a lot of

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell s logicism. Jeff Speaks. September 26, 2007 Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

2. FUNCTIONS AND ALGEBRA

2. FUNCTIONS AND ALGEBRA 2. FUNCTIONS AND ALGEBRA You might think of this chapter as an icebreaker. Functions are the primary participants in the game of calculus, so before we play the game we ought to get to know a few functions.

More information

CHAPTER 4: DATASETS AND CRITERIA FOR ALGORITHM EVALUATION

CHAPTER 4: DATASETS AND CRITERIA FOR ALGORITHM EVALUATION CHAPTER 4: DATASETS AND CRITERIA FOR ALGORITHM EVALUATION 4.1 Overview This chapter contains the description about the data that is used in this research. In this research time series data is used. A time

More information

CHAPTER THREE: RELATIONS AND FUNCTIONS

CHAPTER THREE: RELATIONS AND FUNCTIONS CHAPTER THREE: RELATIONS AND FUNCTIONS 1 Relations Intuitively, a relation is the sort of thing that either does or does not hold between certain things, e.g. the love relation holds between Kim and Sandy

More information

So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special!

So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special! Jerry Fodor and his Special Sciences So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special! ) The use of special in

More information

Entropy and Ergodic Theory Lecture 3: The meaning of entropy in information theory

Entropy and Ergodic Theory Lecture 3: The meaning of entropy in information theory Entropy and Ergodic Theory Lecture 3: The meaning of entropy in information theory 1 The intuitive meaning of entropy Modern information theory was born in Shannon s 1948 paper A Mathematical Theory of

More information

Laws of Nature. What the heck are they?

Laws of Nature. What the heck are they? Laws of Nature What the heck are they? 1 The relation between causes and laws is rather tricky (and interesting!) Many questions are raised, such as: 1. Do laws cause things to happen? 2. What are laws,

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information

MITOCW MITRES_18-007_Part3_lec5_300k.mp4

MITOCW MITRES_18-007_Part3_lec5_300k.mp4 MITOCW MITRES_18-007_Part3_lec5_300k.mp4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources

More information

09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor

09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence

More information

Building a Computer Adder

Building a Computer Adder Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.

More information

MDLP approach to clustering

MDLP approach to clustering MDLP approach to clustering Jacek Tabor Jagiellonian University Theoretical Foundations of Machine Learning 2015 Jacek Tabor (UJ) MDLP approach to clustering TFML 2015 1 / 13 Computer science Ockham s

More information

Algorithms other than SGD. CS6787 Lecture 10 Fall 2017

Algorithms other than SGD. CS6787 Lecture 10 Fall 2017 Algorithms other than SGD CS6787 Lecture 10 Fall 2017 Machine learning is not just SGD Once a model is trained, we need to use it to classify new examples This inference task is not computed with SGD There

More information

First Order Logic (1A) Young W. Lim 11/18/13

First Order Logic (1A) Young W. Lim 11/18/13 Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software

More information

Syllogistic Logic and its Extensions

Syllogistic Logic and its Extensions 1/31 Syllogistic Logic and its Extensions Larry Moss, Indiana University NASSLLI 2014 2/31 Logic and Language: Traditional Syllogisms All men are mortal. Socrates is a man. Socrates is mortal. Some men

More information

TTIC 31230, Fundamentals of Deep Learning, Winter David McAllester. The Fundamental Equations of Deep Learning

TTIC 31230, Fundamentals of Deep Learning, Winter David McAllester. The Fundamental Equations of Deep Learning TTIC 31230, Fundamentals of Deep Learning, Winter 2019 David McAllester The Fundamental Equations of Deep Learning 1 Early History 1943: McCullock and Pitts introduced the linear threshold neuron. 1962:

More information

15 Skepticism of quantum computing

15 Skepticism of quantum computing 15 Skepticism of quantum computing Last chapter, we talked about whether quantum states should be thought of as exponentially long vectors, and I brought up class BQP/qpoly and concepts like quantum advice.

More information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

Multimedia Communications. Mathematical Preliminaries for Lossless Compression

Multimedia Communications. Mathematical Preliminaries for Lossless Compression Multimedia Communications Mathematical Preliminaries for Lossless Compression What we will see in this chapter Definition of information and entropy Modeling a data source Definition of coding and when

More information

Towards a Theory of Information Flow in the Finitary Process Soup

Towards a Theory of Information Flow in the Finitary Process Soup Towards a Theory of in the Finitary Process Department of Computer Science and Complexity Sciences Center University of California at Davis June 1, 2010 Goals Analyze model of evolutionary self-organization

More information

CSC321 Lecture 20: Autoencoders

CSC321 Lecture 20: Autoencoders CSC321 Lecture 20: Autoencoders Roger Grosse Roger Grosse CSC321 Lecture 20: Autoencoders 1 / 16 Overview Latent variable models so far: mixture models Boltzmann machines Both of these involve discrete

More information

Prentice Hall CME Project Algebra

Prentice Hall CME Project Algebra Prentice Hall CME Project Algebra 1 2009 Algebra 1 C O R R E L A T E D T O from March 2009 Algebra 1 A1.1 Relations and Functions A1.1.1 Determine whether a relation represented by a table, graph, words

More information

Logic and machine learning review. CS 540 Yingyu Liang

Logic and machine learning review. CS 540 Yingyu Liang Logic and machine learning review CS 540 Yingyu Liang Propositional logic Logic If the rules of the world are presented formally, then a decision maker can use logical reasoning to make rational decisions.

More information

Axiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:

Axiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system: Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,

More information

Deep Learning and Information Theory

Deep Learning and Information Theory Deep Learning and Information Theory Bhumesh Kumar (13D070060) Alankar Kotwal (12D070010) November 21, 2016 Abstract T he machine learning revolution has recently led to the development of a new flurry

More information

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 9

Designing Information Devices and Systems II Fall 2018 Elad Alon and Miki Lustig Homework 9 EECS 16B Designing Information Devices and Systems II Fall 18 Elad Alon and Miki Lustig Homework 9 This homework is due Wednesday, October 31, 18, at 11:59pm. Self grades are due Monday, November 5, 18,

More information

Classification & Information Theory Lecture #8

Classification & Information Theory Lecture #8 Classification & Information Theory Lecture #8 Introduction to Natural Language Processing CMPSCI 585, Fall 2007 University of Massachusetts Amherst Andrew McCallum Today s Main Points Automatically categorizing

More information

Generative Techniques: Bayes Rule and the Axioms of Probability

Generative Techniques: Bayes Rule and the Axioms of Probability Intelligent Systems: Reasoning and Recognition James L. Crowley ENSIMAG 2 / MoSIG M1 Second Semester 2016/2017 Lesson 8 3 March 2017 Generative Techniques: Bayes Rule and the Axioms of Probability Generative

More information

Variable/Equality Concept

Variable/Equality Concept Congruences and equations Mathematics Unit 8: A transition to Algebra Variable/Equality Concept What is algebra? How would you characterize when a student moves from studying arithmetic to algebra? What

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

CSC321 Lecture 9 Recurrent neural nets

CSC321 Lecture 9 Recurrent neural nets CSC321 Lecture 9 Recurrent neural nets Roger Grosse and Nitish Srivastava February 3, 2015 Roger Grosse and Nitish Srivastava CSC321 Lecture 9 Recurrent neural nets February 3, 2015 1 / 20 Overview You

More information

Philosophy of Religion. Notes on Infinity

Philosophy of Religion. Notes on Infinity Notes on Infinity Infinity in Classical and Medieval Philosophy Aristotle (Metaphysics 986 a 22) reports that limited (peras, πέρας) and unlimited or infinite (apeiron, ἄπειρον) occur as the first pairing

More information

Glossary of Logical Terms

Glossary of Logical Terms Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning

More information

Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic

Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic Salem Benferhat CRIL-CNRS, Université d Artois rue Jean Souvraz 62307 Lens Cedex France benferhat@criluniv-artoisfr

More information

Hidden Markov Models, I. Examples. Steven R. Dunbar. Toy Models. Standard Mathematical Models. Realistic Hidden Markov Models.

Hidden Markov Models, I. Examples. Steven R. Dunbar. Toy Models. Standard Mathematical Models. Realistic Hidden Markov Models. , I. Toy Markov, I. February 17, 2017 1 / 39 Outline, I. Toy Markov 1 Toy 2 3 Markov 2 / 39 , I. Toy Markov A good stack of examples, as large as possible, is indispensable for a thorough understanding

More information

Finite Automata Part One

Finite Automata Part One Finite Automata Part One Computability Theory What problems can we solve with a computer? What kind of computer? Computers are Messy http://www.intel.com/design/intarch/prodbref/27273.htm We need a simpler

More information

Comparing Programming-Physics and Algebra-Physics

Comparing Programming-Physics and Algebra-Physics Comparing Programming-Physics and Algebra-Physics Based on A Comparison of Programming Languages and Algebraic Notation as Expressive Languages for Physics by Bruce L. Sherin Paul Tranquilli 1 1 Computational

More information

Finite Automata Part One

Finite Automata Part One Finite Automata Part One Computability Theory What problems can we solve with a computer? What problems can we solve with a computer? What kind of computer? Computers are Messy http://www.intel.com/design/intarch/prodbref/27273.htm

More information

Theory of Computation

Theory of Computation Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 3: Finite State Automata Motivation In the previous lecture we learned how to formalize

More information

A non-classical refinement of the interpolation property for classical propositional logic

A non-classical refinement of the interpolation property for classical propositional logic Accepted for publication in Logique & Analyse A non-classical refinement of the interpolation property for classical propositional logic Peter Milne Abstract We refine the interpolation property of the

More information

Experiments on the Consciousness Prior

Experiments on the Consciousness Prior Yoshua Bengio and William Fedus UNIVERSITÉ DE MONTRÉAL, MILA Abstract Experiments are proposed to explore a novel prior for representation learning, which can be combined with other priors in order to

More information

DEMBSKI S SPECIFIED COMPLEXITY: A SIMPLE ERROR IN ARITHMETIC

DEMBSKI S SPECIFIED COMPLEXITY: A SIMPLE ERROR IN ARITHMETIC DEMBSKI S SPECIFIED COMPLEXITY: A SIMPLE ERROR IN ARITHMETIC HOWARD A. LANDMAN Abstract. We show that the derivation of Dembski s formula for specified complexity contains a simple but enormous error,

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form

More information

Understanding Aha! Moments

Understanding Aha! Moments Understanding Aha! Moments Hermish Mehta Department of Electrical Engineering & Computer Sciences University of California, Berkeley Berkeley, CA 94720 hermish@berkeley.edu Abstract In this paper, we explore

More information

Relativity. Transcript.

Relativity. Transcript. Relativity Transcript http://quantumspotacademy.org/videos/relativity/ Time, light, mass, energy. These are some of the most fundamental properties in the universe and these are the properties that are

More information

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called

More information

Why write proofs? Why not just test and repeat enough examples to confirm a theory?

Why write proofs? Why not just test and repeat enough examples to confirm a theory? P R E F A C E T O T H E S T U D E N T Welcome to the study of mathematical reasoning. The authors know that many students approach this material with some apprehension and uncertainty. Some students feel

More information

The Celsius temperature scale is based on the freezing point and the boiling point of water. 12 degrees Celsius below zero would be written as

The Celsius temperature scale is based on the freezing point and the boiling point of water. 12 degrees Celsius below zero would be written as Prealgebra, Chapter 2 - Integers, Introductory Algebra 2.1 Integers In the real world, numbers are used to represent real things, such as the height of a building, the cost of a car, the temperature of

More information

Meta-logic derivation rules

Meta-logic derivation rules Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will

More information

Superposition - World of Color and Hardness

Superposition - World of Color and Hardness Superposition - World of Color and Hardness We start our formal discussion of quantum mechanics with a story about something that can happen to various particles in the microworld, which we generically

More information

The Inductive Proof Template

The Inductive Proof Template CS103 Handout 24 Winter 2016 February 5, 2016 Guide to Inductive Proofs Induction gives a new way to prove results about natural numbers and discrete structures like games, puzzles, and graphs. All of

More information

Bits. Chapter 1. Information can be learned through observation, experiment, or measurement.

Bits. Chapter 1. Information can be learned through observation, experiment, or measurement. Chapter 1 Bits Information is measured in bits, just as length is measured in meters and time is measured in seconds. Of course knowing the amount of information is not the same as knowing the information

More information

PHIL 50 - Introduction to Logic

PHIL 50 - Introduction to Logic Euclid Archimedes Gerhard Gentzen PHIL 50 - Introduction to Logic Marcello Di Bello, Stanford University, Spring 2014 Week 3 Monday Class - Derivations in Propositional Logic The Semantic and the Syntactic

More information