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 data from my advisor’s funded research study on family dynamics.  In one phase of the study observers viewed video-taped sessions of family members (parent and child) interacting in various modes (play or work) and coded qualitative features of each moment’s activity over a period of time.

The following page describes the application in more detail and reflects on its implications for the conduct of scientific inquiry in general.

In this application a phrase or string is a fixed-length sequence of qualitative features and a clause or strand is a sequence of such phrases ending with what the observer judges to be a significant pause in activity.

In the qualitative research phases of the study one is simply attempting to discern any significant or recurring patterns in the data one possibly can.

In this case the observers are tokenizing the observations according to a codebook that has passed enough intercoder reliability studies to afford them all a measure of confidence it captures meaningful aspects of whatever reality is passing before their eyes and ears.

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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

Memorial Day Homage to Abraham Lincoln

Two centuries, two score and two years ago our fathers brought forth on this continent, a new nation, conceived in Liberty, and dedicated to the proposition that all people are created equal.

Now we are engaged in a great cultural war, testing whether that nation, or any
nation so conceived and so dedicated, can long endure.  We are met on a great battle-field of that war.  We have dedicated countless fields, here and abroad, as final resting places for those who gave their lives that that nation might live.  It is altogether fitting and proper that we should do this.

But in a larger sense, we can not dedicate—we can not consecrate—we can not hallow—these grounds.  The brave people, living and dead, who fought, have consecrated them, far above our poor power to add or detract.  It is for us the living, rather, to be dedicated to the unfinished work which they who fought have thus far so nobly advanced.  It is rather for us to be dedicated to the great task remaining before us—that from these honored dead we take increased devotion to that cause for which they gave the last full measure of devotion—that we highly resolve that these dead shall not have died in vain—that this nation, under God, shall have a new birth of freedom and understanding of what it means to be truly great—and that government of the people, by the people, for the people, shall not perish from the earth.

With thanks to Abraham Lincoln for his profound words,

Susan Awbrey
June 1, 2018

Posted in Abraham Lincoln, Gettysburg Address, Guest Post, Memorial Day, Susan Awbrey | Tagged , , , , | Leave a comment

Theme One Program • Motivation 5

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 my wife Susan Awbrey made use of Mandelbrot’s ideas about self-similarity in her dissertation and communicated with him about it.  So there’s more to read up on …

Just off-hand, though, I think my Learner is dealing with a different problem.  It has more to do with the savings in effort a learner gets by anticipating future experiences based on its record of past experiences than the savings it gets by minimizing bits of storage as far as mechanically possible.  There is still a type of compression involved but it’s more like Korzybski’s “time-binding” than space-savings proper.  Speaking of old memories …

The other difference I see is that Zipf’s Law applies to an established and preferably large corpus of linguistic material, while my Learner has to start from scratch, accumulating experience over time, making the best of whatever data it has at the outset and every moment thereafter.

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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

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 by individual functions and groups of related functions, still mostly low-level primitives at this point.  The current version is here:

cc: Ontolog Forum • Peirce List (1) (2) (3) (4)Systems Science

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

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 its first application the environment the Learner had to learn was the usage behavior of its user, as given by finite sequences of characters from a finite alphabet which might as well be called words and as given by finite sequences of those words which might as well be called phrases or sentences.  In other words, Job One for the Learner was the job of constructing a user model.

In that frame of mind we are not seeking anything so grand as a Universal Induction Algorithm but simply looking for any approach that gives us a leg up, complexity wise, in Interactive Real Time.

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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 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 did a lot of work on augmentative communication technology for limited mobility users and the observations I made there prompted the first inklings of my Learner program.

Early in that period I visited John’s course in mathematical linguistics, which featured Laws of Form among its readings, along with the more standard fare of Wall, Chomsky, Jackendoff, and the Unified Science volume by Charles Morris which credited Peirce with pioneering the pragmatic theory of signs.  I learned about Zipf’s Law relating the lengths of codes to their usage frequencies and I named the earliest avatar of my Learner program XyPh, partly after Zipf and playing on the xylem and phloem of its tree data structures.

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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 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 two styles of thinking inhabit the very same soul.

The way it came about was this.  The code from which the program is currently assembled initially came from two distinct programs, ones I developed in alternate years, at first only during the summers.

In the Learner program I sought to implement a Humean empiricist style of learning algorithm for the adaptive uptake of coded sequences of occurrences in the environment, say, as codified in a formal language.  I knew all the theorems from formal language theory telling how limited any such strategy must ultimately be in terms of its generative capacity, but I wanted to explore the boundaries of that capacity in concrete computational terms.

In the Modeler program I aimed to implement a variant of Peirce’s graphical syntax for propositional logic, making use of graph-theoretic extensions I had developed over the previous decade.

As I mentioned, work on those two projects proceeded in a parallel series of fits and starts through interwoven summers for a number of years, until one day it dawned on me how the Learner, one of whose aliases was Index, could be put to work helping with sundry substitution tasks the Modeler needed to carry out.

So I began integrating the functions of the Learner and the Modeler, at first still working on the two component modules in an alternating manner, but devoting a portion of effort to amalgamating their principal data structures, bringing them into convergence with each other, and unifying them over a common basis.

Another round of seasons and many changes of mind and programming style, I arrived at a unified graph-theoretic data structure, strung like a wire through the far‑flung pearls of my programmed wit.  But the pearls I polished in alternate years maintained their shine along axes of polarization whose grains remained skew in regard to each other.  To put it more plainly, the strategies I imagined were the smartest tricks to pull from the standpoint of optimizing the program’s performance on the Learning task I found the next year were the dumbest moves to pull from the standpoint of its performance on the Reasoning task.  I gradually came to appreciate that trade-off as a discovery

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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 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 the nature of an environment and being able to apply the information acquired to a specific purpose.

Under the heading of reasoning I am simply lumping together all the ordinary sorts of practical activities which would probably occur to most people under that name.

There is a natural relation between the tasks.  Learning the character of an environment leads to the recognition of laws which govern the environment and making full use of that recognition requires the ability to reason logically about those laws in abstract terms.

Resource

cc: Cybernetics • Ontolog Forum (1) (2) • Systems Science (1) (2)
cc: Peirce List (12-12) (18-02) (18-03) (20-09) (20-10) (21-10)
cc: FB | Theme One Program • Laws of Form (1) (2)

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

Sign Relations, Triadic Relations, Relations • 1

To understand how signs work in Peirce’s theory of triadic sign relations, also known as “semiotics”, we have to understand, in order of increasing generality, sign relations, triadic relations, and relations in general, all as conceived in Peirce’s logic of relative terms and the corresponding mathematics of relations.

Toward that understanding, here are versions of articles I long ago contributed to Wikipedia and have more lately developed at a number of other places.

cc: Ontolog ForumPeirce List

Posted in C.S. Peirce, Icon Index Symbol, Knowledge Representation, Logic, Logic of Relatives, Mathematics, Ontology, Peirce, Pragmatism, Relation Theory, Semiosis, Semiotics, Sign Relations, Triadic Relations, Triadicity | Tagged , , , , , , , , , , , , , , | 16 Comments

Theme One • A Program Of Inquiry 15

An unexpected benefit of cleaning out our basement and putting our belongings in storage was finding a trove of work I thought I’d lost, in a stash of 3½ inch floppies, no less.  I uploaded a sample to a couple of folders on Google Drive.

The first contains a minimal set of files for running the program.
The second contains the example files mentioned in the User Guide.

Apologies in advance for Theme One being a bare prototype, a “test of concept” sort of program.  The user interface is pre-mouse and very finicky but I, its mother, was able to nurse it along far enough to learn a lot from it and many are lessons of still timely pertinence to our perennial issues.

cc: Ontolog Forum • Peirce List (1) (2) (3) (4)

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