Tag Archives: Learning Theory

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Theme One Program • Jets and Sharks 1

Posted on August 25, 2022 by Jon Awbrey

It is easy to spend a long time on the rudiments of learning and logic before getting down to practical applications — but I think we’ve circled square one long enough to expand our scope and see what the category … 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 Inquiry Driven Systems • 4

Posted on August 12, 2022 by Jon Awbrey

This is a Survey of blog and wiki resources 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 … Continue reading →

Posted in Abduction, Action, Adaptive Systems, Aristotle, Artificial Intelligence, Automated Research Tools, Change, Cognitive Science, Communication, Cybernetics, Deduction, Descartes, Dewey, Discovery, Doubt, Education, Educational Systems Design, Educational Technology, Fixation of Belief, Induction, Information, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Interpretation, Invention, Kant, Knowledge, Learning, Learning Theory, Logic, Logic of Science, Mathematics, Mental Models, Peirce, Pragmatic Maxim, Pragmatism, Process Thinking, Scientific Inquiry, Semiotics, Sign Relations, Surveys, Teaching, Triadic Relations, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Theme One Program • Discussion 9

Posted on July 4, 2022 by Jon Awbrey

Re: Theme One Program • Exposition (1) (2) (3) (4) (5) Re: Theme One Program • Discussion (7) (8) Re: Ontolog Forum • Alex Shkotin (1) (2) (3) Dear Alex, I know the material on sign relations I’ve been posting … 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

Theme One Program • Discussion 8

Posted on June 27, 2022 by Jon Awbrey

Re: Theme One Program • Exposition (1) (2) (3) (4) Re: Theme One Program • Discussion (7) Re: Ontolog Forum • Alex Shkotin (1) (2) Re: Logical Graphs • Animated Proofs AS: The animation is mesmerizing:  I would watch and … 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