Category Archives: Artificial Intelligence

Theme One Program • Motivation 2

Posted on June 4, 2024 by Jon Awbrey

A side‑effect of working on the Theme One program over the course of a decade was the measure of insight it gave me into the reasons why empiricists and rationalists have so much trouble understanding each other, even when those … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Computation, Computational Complexity, Cybernetics, Data Structures, Differential Logic, Form, Formal Languages, Graph Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Laws of Form, Learning, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Pragmatics, Programming, Propositional Calculus, Propositional Equation Reasoning Systems, Reasoning, Semantics, Semiotics, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Theme One Program • Motivation 1

Posted on June 3, 2024 by Jon Awbrey

The main idea behind the Theme One program is the efficient use of graph-theoretic data structures for the tasks of “learning” and “reasoning”. I am thinking of learning in the sense of learning about an environment, in essence, gaining information about … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Computation, Computational Complexity, Cybernetics, Data Structures, Differential Logic, Form, Formal Languages, Graph Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Laws of Form, Learning, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Pragmatics, Programming, Propositional Calculus, Propositional Equation Reasoning Systems, Reasoning, Semantics, Semiotics, Sign Relations, Spencer Brown, Syntax, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Survey of Inquiry Driven Systems • 6

Posted on February 28, 2024 by Jon Awbrey

This is a Survey of work in progress on Inquiry Driven Systems, material I plan to refine toward a more compact and systematic treatment of the subject. An inquiry driven system is a system having among its state variables some … Continue reading →

Posted in Abduction, Adaptive Systems, Artificial Intelligence, Automated Research Tools, C.S. Peirce, Cognitive Science, Cybernetics, Deduction, Educational Systems Design, Educational Technology, Fixation of Belief, Induction, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Interpretation, Logic, Logic of Science, Mathematics, Mental Models, Pragmatic Maxim, Semiotics, Sign Relations, Triadic Relations, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 19 Comments

Survey of Theme One Program • 6

Posted on February 26, 2024 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 35 Comments

Survey of Inquiry Driven Systems • 5

Posted on April 23, 2023 by Jon Awbrey

This is a Survey of work in progress on Inquiry Driven Systems, material I plan to refine toward a more compact and systematic treatment of the subject. An inquiry driven system is a system having among its state variables some … Continue reading →

Posted in Abduction, Adaptive Systems, Artificial Intelligence, Automated Research Tools, C.S. Peirce, Cognitive Science, Cybernetics, Deduction, Educational Systems Design, Educational Technology, Fixation of Belief, Induction, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Interpretation, Logic, Logic of Science, Mathematics, Mental Models, Pragmatic Maxim, Semiotics, Sign Relations, Triadic Relations, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 5 Comments

Abduction, Deduction, Induction, Analogy, Inquiry • 31

Posted on October 14, 2022 by Jon Awbrey

Re: Scott Aaronson • Explanation-Gödel and Plausibility-Gödel Scott Aaronson asks a question arising from Gödel’s First Incompleteness Theorem, namely, what are its consequences for the differential values of explanation, plausibility, and proof?  I add the following thoughts. A general heuristic … Continue reading →

Posted in Abduction, Analogy, Animata, Aristotle, Artificial Intelligence, C.S. Peirce, Deduction, Induction, Inquiry, Inquiry Driven Systems, Intelligent Systems Engineering, Logic, Mathematics, Scientific Method, Semiotics, Visualization | Tagged , , , , , , , , , , , , , , , | 5 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 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. Syntax.  The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective … 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