Tag Archives: Computational Complexity

Theme One Program • Motivation 2

Posted on May 17, 2018 by Jon Awbrey

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

Theme One Program • Motivation 1

Posted on May 15, 2018 by Jon Awbrey

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

Differential Logic • Comment 3

Posted on December 30, 2017 by Jon Awbrey

In my previous comment on boundaries in object universes and venn diagrams, and always when I’m being careful about their mathematical senses, the definitions of “topology” and “boundary” I have in mind can be found in any standard textbook.  Here are … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Diagrammatic Reasoning, Differential Analytic Turing Automata, Differential Logic, Discrete Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , | 10 Comments

Differential Logic • Comment 2

Posted on December 28, 2017 by Jon Awbrey

As always, we have to distinguish between the diagram itself, the representation or sign inscribed in some medium, and the formal object it represents under a given interpretation. A venn diagram is an iconic sign we use to represent a … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Diagrammatic Reasoning, Differential Analytic Turing Automata, Differential Logic, Discrete Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Differential Logic • Comment 1

Posted on December 21, 2017 by Jon Awbrey

Re: Gil Kalai • Pivotal Variables Just a tangential association with respect to logical influence and pivotability.  I have been exploring questions related to pivotal variables (“Differences that Make a Difference” or “Difference In ⟹ Difference Out”) via logical analogues … Continue reading →

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Differential Analytic Turing Automata, Differential Logic, Discrete Dynamical Systems, Graph Theory, Hill Climbing, Hologrammautomaton, Logic, Logical Graphs, Logical Influence, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Pivotal Variables, Propositional Calculus, Propositional Equation Reasoning Systems, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , | 10 Comments

Abduction, Deduction, Induction, Analogy, Inquiry • 4

Posted on February 26, 2016 by Jon Awbrey

Re: FB | Ecology Of Systems Thinking • Steven Wallis Peirce sought to understand what all varieties of inquiry, ranging from everyday reasoning and problem solving to full-fledged scientific method, have in common.  Taking a cue from Aristotle he developed … Continue reading →

Posted in Abduction, Analogy, Aristotle, Artificial Intelligence, C.S. Peirce, Computation, Computational Complexity, Deduction, Induction, Inquiry, Inquiry Driven Systems, Intelligent Systems, Logic, Problem Solving, Semiotics | Tagged , , , , , , , , , , , , , , | 6 Comments

Abduction, Deduction, Induction, Analogy, Inquiry • 3

Posted on February 17, 2016 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Waves, Hazards, Guesses Aristotle’s apagoge, variously translated as abduction, reduction, or retroduction, is a form of reasoning common to two types of situations. Abduction may involve either of the following two operations. The … Continue reading →

Posted in Abduction, Analogy, Aristotle, Artificial Intelligence, C.S. Peirce, Computation, Computational Complexity, Deduction, Induction, Inquiry, Inquiry Driven Systems, Intelligent Systems, Logic, Problem Solving, Semiotics | Tagged , , , , , , , , , , , , , , | 6 Comments

Survey of Animated Logical Graphs • 1

Posted on May 10, 2015 by Jon Awbrey

This is one of several Survey posts I’ll be drafting from time to time, starting with minimal stubs and collecting links to the better variations on persistent themes I’ve worked on over the years.  After that I’ll look to organizing … Continue reading →

Posted in Abstraction, Amphecks, Animata, Boole, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Surveys, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Frankl, My Dear • 12

Posted on November 24, 2014 by Jon Awbrey

It is one of the rules of my system of general harmony, that the present is big with the future, and that he who sees all sees in that which is that which shall be. Leibniz • Theodicy Re: Dick … Continue reading →

Posted in Boolean Algebra, Boolean Functions, Computational Complexity, Differential Logic, Frankl Conjecture, Logic, Logical Graphs, Mathematics, Péter Frankl | Tagged , , , , , , , , | 10 Comments

Frankl, My Dear • 11

Posted on November 10, 2014 by Jon Awbrey

Re: Dick Lipton & Ken Regan • (1) • (2) Let’s take a moment from the differential analysis of the proposition in Example 1 to form a handy compendium of the results obtained so far. Example 1 (1) Enlargement Map of … Continue reading →

Posted in Boolean Algebra, Boolean Functions, Computational Complexity, Differential Logic, Frankl Conjecture, Logic, Logical Graphs, Mathematics, Péter Frankl | Tagged , , , , , , , , | 10 Comments