Category Archives: Inquiry Driven Systems

Inquiry Driven Systems • Comment 4

Re: Ontolog Forum • Matthew West In the systems approach to inquiry I’ve been pursuing, all specifications, state descriptions, or values of variables come in three modalities:  expected, intended, and actually observed. A difference between expectation and observation is accounted … Continue reading

Posted in Animata, Artificial Intelligence, C.S. Peirce, Cybernetics, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Learning Systems, Logic, Logical Graphs, Peirce, Semiotics, Sign Relations, Visualization | Tagged , , , , , , , , , , , , , , | 8 Comments

Constraints and Indications • 2

Re: Ontolog Forum • Joseph Simpson Coping with collaboration, communication, context, integration, interoperability, perspective, purpose, and the reality of the information dimension demands a transition from conceptual environments bounded by dyadic relations to those informed by triadic relations, especially the … Continue reading

Posted in Adaptive Systems, Artificial Intelligence, Ashby, C.S. Peirce, Constraint, Control, Cybernetics, Determination, Error-Controlled Regulation, Feedback, Indication, Indicator Functions, Information, Inquiry, Inquiry Driven Systems, Intelligent Systems, Intentionality, Learning Theory, Peirce, Semiotic Information, Semiotics, Systems Theory, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Inquiry Driven Systems • Comment 3

Re: Ontolog Forum • Michael DeBellis I remember Doug Medin from the year I was at Illinois and I recall a colloquium talk Frank Keil gave at Michigan State which intrigued me because he echoed ideas from Kant about the … Continue reading

Posted in Animata, Artificial Intelligence, C.S. Peirce, Cybernetics, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Learning Systems, Logic, Logical Graphs, Peirce, Semiotics, Sign Relations, Visualization | Tagged , , , , , , , , , , , , , , | 8 Comments

Theme One Program • Discussion 4

Re: Systems Science • Joseph Simpson Let me step back and talk about the research intention driving this work. In a very real sense everything I’ve been doing along this line of inquiry for the last fifty years falls within … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Discussion 3

What I’m doing this summer … Eighteen years living in the same place and we blissfully forgot what it takes to pack up a house and find a new one.  Thankfully most of the renovation work is done but it’s … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Discussion 2

Re: Systems Science • Joseph Simpson Warfield gets it right about the relationship between object languages and metalanguages.  Something about the prefix meta- has contributed to a not uncommon misconception that metalanguages are formalized to a higher degree than the … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Exposition 3

Coding Logical Graphs My earliest experiments coding logical graphs as dynamic “pointer” data structures taught me that conceptual and computational efficiencies of a critical sort could be achieved by generalizing their abstract graphs from trees to the variety graph theorists … 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 2

The previous post described the elementary data structure used to represent nodes of graphs in the Theme One program.  This post describes the specific family of graphs employed by the program. Figure 1 shows a typical example of a painted … 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 1

Theme One is a program for building and transforming a particular species of graph-theoretic data structures, forms designed to support a variety of fundamental learning and reasoning tasks. The program evolved over the course of an exploration into the integration … 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 • Motivation 6

Comments I made in reply to a correspondent’s questions about delimiters and tokenizing in the Learner module may be worth sharing here. As a part of my M.A. work in psychology I applied my Theme One program to samples of … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments