Category Archives: Computing

Survey of Theme One Program • 1

This is a Survey of previous blog and wiki posts on the Theme One Program that I worked on all through the 1980s. The aim of the project was to develop fundamental algorithms and data structures to support an integrated … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Cognitive Science, Computation, Computational Complexity, Computer Science, Computing, Constraint Satisfaction Problems, Cybernetics, Data Structures, Diagrammatic Reasoning, Diagrams, Differential Analytic Turing Automata, Education, Educational Systems Design, Educational Technology, Equational Inference, Functional Logic, Graph Theory, Indicator Functions, Inquiry, Inquiry Driven Education, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Knowledge, Learning, Learning Theory, Logic, Logical Graphs, Machine Learning, Mathematics, Mental Models, Minimal Negation Operators, Painted Cacti, Peirce, Programming, Programming Languages, Propositional Calculus, Propositional Equation Reasoning Systems, Propositions, Research Technology, Semeiosis, Semiosis, Semiotics, Sign Relations, Surveys, Teaching, Theorem Proving, Triadic Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Oracles

Computing, in its way, and science, in its broader way, both involve the relation between what appears limited and what appears not. Whether you believe in divinity or not, and whether you believe that humanity contains a spark of divinity … Continue reading

Posted in Communication, Computability, Computing, Inquiry, Oracles, Relative Computability, Science, Universals | Tagged , , , , , , , | 2 Comments