Category Archives: Formal Language Theory

Infinite Uses → Finite Means

The idea that a language is based on a system of rules determining the interpretation of its infinitely many sentences is by no means novel.  Well over a century ago, it was expressed with reasonable clarity by Wilhelm von Humboldt in … Continue reading

Posted in Cartesian Linguistics, Chomsky, Finite Means, Formal Language Theory, Formal Languages, Foundations of Mathematics, Generative Grammar, Infinite Use, Language, Linguistics, Pigeonhole Principle, Recursion, Syntax, Wilhelm von Humboldt | Tagged , , , , , , , , , , , , , | Leave a comment

Ask Meno Questions • Code Meno Code

Adapted from Prospects for Inquiry Driven Systems 1.1.2.3. The Trees, The Forest A sticking point of the whole discussion has just been reached. In the idyllic setting of a knowledge field the question of systematic inquiry takes on the following … Continue reading

Posted in Algorithms, Artificial Intelligence, Automata, Education, Epistemology, Formal Language Theory, Formal Languages, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning, Meno, Philosophy, Plato, Programming, Programming Languages, Socrates, Teaching | Tagged , , , , , , , , , , , , , , , , , | 2 Comments

Propositions As Types : 1

Re: R.J. Lipton • Mathematical Tricks One of my favorite mathematical tricks — it seems almost too tricky to be true — is the Propositions As Types Analogy.  And I see hints the 2-part analogy can be extended to a 3-part … Continue reading

Posted in Abstraction, C.S. Peirce, Combinator Calculus, Combinatory Logic, Computation, Computational Complexity, Computer Science, Curry–Howard Isomorphism, Formal Language Theory, Graph Theory, Lambda Calculus, Logic, Logical Graphs, Mathematics, Peirce, Programming Languages, Propositions As Types Analogy, Type Theory | Tagged , , , , , , , , , , , , , , , , , | Leave a comment

Theme One • A Program Of Inquiry : 3

Re: Peirce List Discussion • Gary Richmond The program I wrote for my M.A. in Psych was barely a prototype, a “test of concept”, as they say, but I continued to develop and apply the underlying collection of ideas to … Continue reading

Posted in Artificial Intelligence, C.S. Peirce, Computation, Cybernetics, Formal Language Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Peirce, Programming, Semiotics, Systems Theory | Tagged , , , , , , , , , , , , , | 1 Comment

Theme One • A Program Of Inquiry : 2

Re: Peirce List Discussion • Jerry Chandler I think I was probably the first person in that particular psychology department to submit a program as a master’s thesis, at any rate they didn’t have regular procedures set up for that … Continue reading

Posted in Animata, Artificial Intelligence, C.S. Peirce, Computation, Cybernetics, Formal Language Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Peirce, Programming, Semiotics, Systems Theory | Tagged , , , , , , , , , , , , , , | 1 Comment

Theme One • A Program Of Inquiry : 1

Re: Peirce List Discussion • JLRC • JA • GR • CM I view psychology, throughout its many branches, as a fascinating and compelling collection of subjects, so much so that I spent one of my parallel lives in the … Continue reading

Posted in Artificial Intelligence, C.S. Peirce, Computation, Cybernetics, Formal Language Theory, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Peirce, Programming, Semiotics, Systems Theory | Tagged , , , , , , , , , , , , , | 1 Comment