Category Archives: Computation

Riffs and Rotes, Finite Partial Functions • Overview

Posted on November 14, 2026 by Jon Awbrey

Riffs and Rotes are two species of graph-theoretic structure in a mathematical framework which establishes a bijective Gödel numbering between the positive integers and finite partial functions mapping to .  This framework strips away the standard arithmetic properties of numbers … Continue reading →

Posted in Algebra, Arithmetic, Combinatorics, Computation, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Recursion, Representation, Riffs and Rotes, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | Leave a comment

Riffs and Rotes • Overview

Posted on November 14, 2026 by Jon Awbrey

Riffs and Rotes are two species of graph-theoretic structure giving visual representation to the primes factorizations of integers, specifically looking at “doubly recursive factorizations”. The Core Concept When a number is broken down into its prime factors, those primes can … Continue reading →

Posted in Algebra, Arithmetic, Combinatorics, Computation, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Recursion, Representation, Riffs and Rotes, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | Leave a comment

Riffs and Rotes • Happy New Year 2026

Posted on January 1, 2026 by Jon Awbrey

No information is lost by dropping the terminal 1s.  Thus we may write the following form. The article linked below tells how forms of that order correspond to a family of digraphs called riffs and a family of graphs called … Continue reading →

Posted in Algebra, Arithmetic, Combinatorics, Computation, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Recursion, Representation, Riffs and Rotes, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | Leave a comment

Riffs and Rotes • Happy New Year 2025

Posted on January 1, 2025 by Jon Awbrey

No information is lost by dropping the terminal 1s.  Thus we may write the following form. The article linked below tells how forms of that sort correspond to a family of digraphs called riffs and a family of graphs called … Continue reading →

Posted in Algebra, Arithmetic, Combinatorics, Computation, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Recursion, Representation, Riffs and Rotes, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | 2 Comments

Theme One Program • Jets and Sharks 3

Posted on June 23, 2024 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 5 Comments

Theme One Program • Jets and Sharks 2

Posted on June 22, 2024 by Jon Awbrey

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 graph represents a single logical formula in propositional calculus 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Jets and Sharks 1

Posted on June 20, 2024 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Theme One Program • Exposition 9

Posted on June 19, 2024 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Theme One Program • Exposition 8

Posted on June 18, 2024 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. Syntax.  The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective … 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

Theme One Program • Exposition 7

Posted on June 17, 2024 by Jon Awbrey

Logical Cacti Up till now we’ve been working to hammer out a two‑edged sword of syntax, honing the syntax of cactus graphs and cactus expressions and turning it to use in taming the syntax of two‑level formal languages. But 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 , , , , , , , , , , , , , , , , , , , , , , , , , , | 4 Comments