Tag Archives: Computational Complexity

Objects, Models, Theories : 4

Posted on November 27, 2013 by Jon Awbrey

I need to stay with this problem a while … What are objects, models, theories, and how do they relate to one another? In contemplating this problem I always find it helpful to ruminate on the diagram shown above — … Continue reading →

Posted in Adaptive Systems, Analogy, Aristotle, Artificial Intelligence, Biological Systems, C.S. Peirce, Computational Complexity, Evolution, Gödel, Information, Information Theory, Inquiry, Inquiry Driven Systems, Learning Theory, Logic, Logic of Science, Mathematical Models, Mental Models, Model Theory, Natural Intelligence, Paradigms, Peirce, Pragmata, Semiotics, Sign Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Objects, Models, Theories : 3

Posted on November 21, 2013 by Jon Awbrey

Re: Peirce List Discussion • Tom Gollier Here my task is to build bridges between several different classical and contemporary uses of the word model, so I don’t have the luxury of complete control over the words in play but … Continue reading →

Posted in Adaptive Systems, Analogy, Aristotle, Artificial Intelligence, Biological Systems, C.S. Peirce, Computational Complexity, Evolution, Gödel, Information, Inquiry, Inquiry Driven Systems, Learning Theory, Logic, Logic of Science, Mathematical Models, Mental Models, Model Theory, Natural Intelligence, Peirce, Pragmata, Semiotics, Sign Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , | 4 Comments

Objects, Models, Theories : 2

Posted on November 20, 2013 by Jon Awbrey

Re: K.W. Regan • The Graph Of Math Re: Artem Kaznatcheev • Three Types Of Mathematical Models What — if anything — is the common sense that connects the different senses of the word model, as it has been used … Continue reading →

Posted in Adaptive Systems, Analogy, Aristotle, Artificial Intelligence, Biological Systems, C.S. Peirce, Computational Complexity, Evolution, Gödel, Information, Inquiry, Inquiry Driven Systems, Learning Theory, Logic, Logic of Science, Mathematical Models, Mental Models, Model Theory, Natural Intelligence, Peirce, Pragmata, Semiotics | Tagged , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Differential Analytic Turing Automata • Discussion 1

Posted on October 14, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Proving Cook’s Theorem Synchronicity Rules❢ I just started reworking an old exposition of mine on Cook’s Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it … Continue reading →

Posted in Algorithms, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Differential Analytic Turing Automata, Differential Logic, Logic, Logical Graphs, Peirce, Propositional Calculus, Turing Machines | Tagged , , , , , , , , , , , | 2 Comments

Where Is Fancy Bred?

Posted on August 24, 2013 by Jon Awbrey

Re: Artem Kaznatcheev • Fitness Landscapes as Mental & Mathematical Models of Evolution The question of “mental models” has occupied my thoughts for quite a while. As intelligent agents with a capacity for inquiry, we have ways of forming and … Continue reading →

Posted in Adaptive Systems, Analogy, Artem Kaznatcheev, Artificial Intelligence, Biological Systems, Communication, Computational Complexity, Control, Evolution, Fitness Landscapes, Imagination, Information, Inquiry, Inquiry Driven Systems, Learning Theory, Mathematical Models, Mental Models, Natural Intelligence, Semiotics, Sign Relations | Tagged , , , , , , , , , , , , , , , , , , , | 1 Comment

How To Succeed In Proof Business Without Really Trying

Posted on July 15, 2013 by Jon Awbrey

Re: R.J. Lipton • Surely You Are Joking? Comment 1 Even at the mailroom entry point of propositional calculus, there is a qualitative difference between insight proofs and routine proofs.  Human beings can do either sort, as a rule, but … Continue reading →

Posted in Algorithms, Animata, Artificial Intelligence, Automatic Theorem Proving, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Model Theory, Peirce, Praeclarum Theorema, Proof Theory, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , , , | 7 Comments

Fourier Transforms of Boolean Functions • 2

Posted on June 4, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Twin Primes Are Useful Note.  Just another sheet of scratch paper, exploring possible alternatives to the Fourier transforms in the previous post.  As a rule, I like to keep Boolean problems in Boolean … Continue reading →

Posted in Boolean Functions, Computational Complexity, Fourier Transforms, Harmonic Analysis, Logic, Mathematics, Propositional Calculus | Tagged , , , , , , | Leave a comment

Special Classes of Propositions

Posted on May 31, 2013 by Jon Awbrey

Adapted from Differential Propositional Calculus • Special Classes of Propositions A basic proposition, coordinate proposition, or simple proposition in the universe of discourse is one of the propositions in the set Among the propositions in are several families of propositions … Continue reading →

Posted in Boolean Functions, Computational Complexity, Differential Logic, Equational Inference, Functional Logic, Indication, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , | 2 Comments

Fourier Transforms of Boolean Functions • 1

Posted on May 30, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Twin Primes Are Useful The problem is concretely about Boolean functions of variables, and seems not to involve prime numbers at all. For any subset of the coordinate [indices], the corresponding Fourier coefficient … Continue reading →

Posted in Boolean Functions, Computational Complexity, Fourier Transforms, Harmonic Analysis, Logic, Mathematics, Propositional Calculus | Tagged , , , , , , | 1 Comment

Finding a Needle in a Cactus Patch

Posted on April 30, 2013 by Jon Awbrey

Re: R.J. Lipton • Sex, 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 … Continue reading →

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 | Tagged , , , , , , , , , , , , | 4 Comments