Category Archives: Form

Theme One Exposition • 3

Re: Systems Science • Structural Modeling Coding Logical Graphs My earliest experiments with coding logical graphs as pointer data structures taught me that conceptual and computational efficiencies of a critical sort could be achieved by generalizing their abstract graphs from … 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, Spencer Brown, Syntax, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Exposition • 2

Re: Systems Science • Ontolog Forum • Laws Of Form • Structural Modeling 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 … 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, Spencer Brown, Syntax, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Exposition • 1

Theme One is a program for building and transforming a particular species of graph-theoretic data structures in memory, structures that have been designed to support a variety of fundamental learning and reasoning tasks. The program was developed as a part 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, Spencer Brown, Syntax, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

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

Theme One Program • Motivation 5

As I’m working from 40-year-old memories of these 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 … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Theme One Program • Motivation 4

From Zipf’s Law and the category of “things that vary inversely to frequency” I got my first brush with the idea that keeping track of usage frequencies is part and parcel of building efficient codes. In it’s first application the … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Theme One Program • Motivation 3

Sometime around 1970 John B. Eulenberg came from Stanford to direct Michigan State’s Artificial Language Lab, where I would come to spend many interesting hours hanging out all through the 70s and 80s.  Along with its research program the lab … 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 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Theme One Program • Motivation 2

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

Theme One Program • Motivation 1

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

Definition and Determination • 17

Re: Ontolog Forum • Richard McCullough RM:  We clearly have some differences in the “definition” of “definition”. I suppose it all depends on the sorts of things one wants to define, something we might call the context of application.  I am … Continue reading

Posted in C.S. Peirce, Comprehension, Constraint, Definition, Determination, Extension, Form, Geometry, Graph Theory, Group Theory, Indication, Information = Comprehension × Extension, Inquiry, Inquiry Driven Systems, Intension, Logic, Logic of Relatives, Logical Graphs, Mathematics, Peirce, Relation Theory, Semiotics, Sign Relations, Topology | Tagged , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment