Category Archives: Learning Theory

Survey of Cybernetics • 3

Posted on April 26, 2023 by Jon Awbrey

Again, in a ship, if a man were at liberty to do what he chose, but were devoid of mind and excellence in navigation (αρετης κυβερνητικης), do you perceive what must happen to him and his fellow sailors? Plato • … Continue reading →

Posted in Abduction, C.S. Peirce, Communication, Control, Cybernetics, Deduction, Determination, Discovery, Doubt, Epistemology, Fixation of Belief, Induction, Information, Information = Comprehension × Extension, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Interpretation, Invention, Knowledge, Learning Theory, Logic, Logic of Relatives, Logic of Science, Mathematics, Peirce, Philosophy, Philosophy of Science, Pragmatic Information, Probable Reasoning, Process Thinking, Relation Theory, Scientific Inquiry, Scientific Method, Semeiosis, Semiosis, Semiotic Information, Semiotics, Sign Relational Manifolds, Sign Relations, Surveys, Triadic Relations, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Program • Discussion 10

Posted on April 17, 2023 by Jon Awbrey

Re: Mathstodon • Seamus Bradley SB: I thought of a programming language where every function can only return one type:  the return type.  The return type is just a wrapper around a struct that contains the actual return value, but … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Survey of Pragmatic Semiotic Information • 6

Posted on April 4, 2023 by Jon Awbrey

This is a Survey of previous blog and wiki posts on the Semiotic Theory Of Information.  All my projects are exploratory in essence but this line of inquiry is more open-ended than most.  The question is: What is information and how … Continue reading →

Posted in Abduction, C.S. Peirce, Communication, Control, Cybernetics, Deduction, Determination, Discovery, Doubt, Epistemology, Fixation of Belief, Induction, Information, Information = Comprehension × Extension, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Interpretation, Invention, Knowledge, Learning Theory, Logic, Logic of Relatives, Logic of Science, Mathematics, Peirce, Philosophy, Philosophy of Science, Pragmatic Information, Probable Reasoning, Process Thinking, Relation Theory, Scientific Inquiry, Scientific Method, Semeiosis, Semiosis, Semiotic Information, Semiotics, Sign Relational Manifolds, Sign Relations, Surveys, Triadic Relations, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Survey of Theme One Program • 5

Posted on March 30, 2023 by Jon Awbrey

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning.  I … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Theme One Program • Exposition 8

Posted on October 8, 2022 by Jon Awbrey

Transformation Rules and Equivalence Classes The abstract character of the cactus language relative to its logical interpretations makes it possible to give abstract rules of equivalence for transforming cacti among themselves and partitioning the space of cacti into formal equivalence … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 7

Posted on September 30, 2022 by Jon Awbrey

Mathematical Structure and Logical Interpretation The main things to take away from the previous post are the following two ideas, one syntactic and one semantic. The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective operations. … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Exposition 6

Posted on September 29, 2022 by Jon Awbrey

Quickly recapping the discussion so far, we started with a data structure called an idea‑form flag and adopted it as a building block for constructing a species of graph-theoretic data structures called painted and rooted cacti.  We showed how to code … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Survey of Cybernetics • 2

Posted on September 8, 2022 by Jon Awbrey

Again, in a ship, if a man were at liberty to do what he chose, but were devoid of mind and excellence in navigation (αρετης κυβερνητικης), do you perceive what must happen to him and his fellow sailors? Plato • … Continue reading →

Posted in Abduction, C.S. Peirce, Communication, Control, Cybernetics, Deduction, Determination, Discovery, Doubt, Epistemology, Fixation of Belief, Induction, Information, Information = Comprehension × Extension, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Interpretation, Invention, Knowledge, Learning Theory, Logic, Logic of Relatives, Logic of Science, Mathematics, Peirce, Philosophy, Philosophy of Science, Pragmatic Information, Probable Reasoning, Process Thinking, Relation Theory, Scientific Inquiry, Scientific Method, Semeiosis, Semiosis, Semiotic Information, Semiotics, Sign Relational Manifolds, Sign Relations, Surveys, Triadic Relations, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Jets and Sharks 3

Posted on September 3, 2022 by Jon Awbrey

Re: Theme One Program • Jets and Sharks • (1) • (2) Example 5. Jets and Sharks (cont.) Given a representation of the Jets and Sharks universe in computer memory, we naturally want to see if the memory serves to … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Jets and Sharks 2

Posted on August 30, 2022 by Jon Awbrey

Re: Theme One Program • Jets and Sharks • (1) Example 5. Jets and Sharks (cont.) As we saw last time, Theme One reads the text file shown below and constructs a cactus graph data structure in computer memory.  The cactus … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments