Tag Archives: Data Structures

Theme One • A Program Of Inquiry 17

Posted on December 7, 2018 by Jon Awbrey

The move is all over but the unpacking, and the time looks ripe to pick up the following thread from last spring.  Here, by way of a quick refresher, are a few Tables from earlier discussions. Theme One • A … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Theme One Program • Discussion 4

Posted on June 28, 2018 by Jon Awbrey

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

Posted on June 26, 2018 by Jon Awbrey

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

Posted on June 11, 2018 by Jon Awbrey

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

Posted on June 10, 2018 by Jon Awbrey

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

Posted on June 9, 2018 by Jon Awbrey

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

Posted on June 8, 2018 by Jon Awbrey

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

Posted on June 2, 2018 by Jon Awbrey

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

Theme One Program • Motivation 5

Posted on May 30, 2018 by Jon Awbrey

Since I’m working from decades-old memories of first inklings I thought I might peruse the web for current information about Zipf’s Law.  I see there is now something called the Zipf–Mandelbrot (and sometimes –Pareto) Law and that was interesting because … 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

Theme One • A Program Of Inquiry 16

Posted on May 28, 2018 by Jon Awbrey

It looks like my time will be at the mercy of contractors and realtors most of the summer but I’ll continue with the informal exposition as time permits.  I’ve also returned to work on the formal documentation, organizing the commentary … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 9 Comments