Finding a Needle in a Cactus Patch

Re: R.J. LiptonSex, Lies, And Quantum Computers

Don’t know much about quantum computation, but my ventures in graphical syntaxes for propositional calculus did turn up a logical operator whose evaluation process reminded me a little of the themes involved in the collapse of the wave function.

Here is the essential information —

Boolean formulas constructed from minimal negation operators can be given graph-theoretic representation as “decorated” or “painted” versions of rooted cactus graphs.

Here are a couple of places where you can see some pictures and a description of the Fundamental Evaluation Rule for cactus expressions of propositional formulas.

This entry was posted in Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Quantum Computing, Semiotics and tagged , , , , , , , , , , , , . Bookmark the permalink.

4 Responses to Finding a Needle in a Cactus Patch

  1. Ivan Antonowitz says:

    Reading your “Cactus Calculus”. A beautiful piece of work!
    Can I send you a .jpg file of how I display the projections as in your
    “Figure 67. Syll c B^3 and its Dyadic Projections”?

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 )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.