Animated Logical Graphs : 5

Re: Peirce List DiscussionHoward Pattee

A computational problem is defined as a set of problem instances with specified properties.  An algorithm solves a problem if it computes the correct answer to every problem instance in that set.

The use of a problem instance as an expository example is to represent its problem class and to provide some idea of how the algorithm works.  A single problem instance can always be addressed by special pleading but the test of an algorithm is whether it handles the whole set of problem instances.

The program I wrote uses an extended topological variant of Peirce’s Alpha Graphs as its main data structure for representing propositions and it uses a general purpose algorithm that finds the complete set of satisfying logical interpretations for any proposition given on input.  This is tantamount to using propositional calculus as a very simple form of declarative programming language.


This entry was posted in Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

One Response to Animated Logical Graphs : 5

  1. Pingback: Survey of Animated Logical Graphs • 1 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s