Category Archives: Computational Complexity

Differential Logic and Dynamic Systems • Overview

In modeling intelligent systems, whether we are trying to understand a natural system or engineer an artificial system, there has long been a tension or trade-off between dynamic paradigms and symbolic paradigms.  Dynamic models take their cue from physics, using … Continue reading

Posted in Amphecks, Boolean Functions, C.S. Peirce, Cactus Graphs, Category Theory, Change, Computational Complexity, Cybernetics, Differential Analytic Turing Automata, Differential Calculus, Differential Logic, Discrete Dynamics, Dynamical Systems, Equational Inference, Functional Logic, Gradient Descent, Graph Theory, Group Theory, Hologrammautomaton, Indicator Functions, Logic, Logical Graphs, Mathematical Models, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Propositional Equation Reasoning Systems, Time, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Abduction, Deduction, Induction, Analogy, Inquiry : 27

Re: Gil Kalai • Avi Wigderson : “Integrating Computational Modeling, Algorithms, and Complexity into Theories of Nature Marks a New Scientific Revolution!” I took a look at Avi’s paper “On the Nature of the Theory of Computation” (OtNotToC).  There is … Continue reading

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

Abduction, Deduction, Induction, Analogy, Inquiry : 26

Re: Gil Kalai • Avi Wigderson : “Integrating Computational Modeling, Algorithms, and Complexity into Theories of Nature Marks a New Scientific Revolution!” Projects giving a central place to computation in scientific inquiry go back to Hobbes and Leibniz, at least, … Continue reading

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

Survey of Animated Logical Graphs • 2

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

Abduction, Deduction, Induction, Analogy, Inquiry : 25

Re: Artem Kaznatcheev • Reductionism : To Computer Science From Philosophy The sense of reduction operative in complexity theory has its roots in Aristotle’s απαγωγη, variously translated as abduction or reduction and sometimes glossed as retroduction by C.S. Peirce.  See my … Continue reading

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

Theme One • A Program Of Inquiry : 17

Re: Ontolog Forum • (1) Re: Systems Science • (1) Re: Laws Of Form • (1) • (2) • (3) • (4) The move is all over but the unpacking, and the time looks ripe to pick up this thread … 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, Spencer Brown, Syntax, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Where Is Fancy Bred? • Comment 1

Re: Artem Kaznatcheev • Labyrinth : Fitness Landscapes As Mazes, Not Mountains A species in progress, with its naturally evolved organs of sensitivity, effectivity, and discernment, in its trials to learn the properties of its environment, cannot be expected to … 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 , , , , , , , , , , , , , , , , , , , | Leave a comment