Riffs and Rotes • 2

Re: Peter CameronAddition and Multiplication of Natural Numbers

The interaction between addition and multiplication in the natural numbers has long been an interest of mine, leading to broader questions about the relationship between algebra and combinatorics.  My gropings with those enigmas led me to the structures of Riffs and Rotes, extracting what we might think of as the “purely combinatorial” properties of primes factorizations.  Thinking of the additive structure of the positive integers as embodied in their total linear ordering, the following two questions arise.

  • How much of the natural ordering of the natural numbers is purely combinatorial?
  • What additional axioms on the partial orders of Riffs and Rotes would restore their natural order?

Reference

cc: Category TheoryCyberneticsOntolog Forum • Peirce List (1) (2)SeqFan
cc: FB | Riffs and RotesLaws of FormStructural ModelingSystems Science

Posted in Arithmetic, Combinatorics, Graph Theory, Group Theory, Logic, Mathematics, Number Theory, Riffs and Rotes | 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 or not, we have to acknowledge that
our powers as oracles are limited and, even if they were
not, problems of relative computability would still arise
in the striving of oracles to communicate with one another.
Posted in Communication, Computability, Computing, Inquiry, Oracles, Relative Computability, Science, Universals | Tagged , , , , , , , | 3 Comments

Quotiens?

How many times do I repeat the same experience?
Before I come to see it as the same experience?
Posted in Algorithms, Anamnesis, Arithmetic, Deja Vu, Education, Epistemology, Eternal Return, Inquiry, Learning, Meno, Music, Pattern Recognition, Plato, Poetry, Recursion, Repetition, Rhythm, Teaching | Tagged , , , , , , , , , , , , , , , , , | 2 Comments

Poems and Programs

Words that do …

A trendy misunderstanding has reared its head as to what the discipline of computing, indeed the logic of science, are all about.  I blame Penrose, of course, but he is only the most recent promulgator of the recurring misunderstanding.

There are only a countable number of computable functions, so it’s no surprise a natural system picked at random will have non-computable functional features.  Saying not all natural systems are computable is like saying not all poems are sonnets.  Writing a program to model a significant aspect of a natural system is like writing a sonnet to express a significant aspect of human experience.  It’s a voluntary limitation programmers and poets accept for the sake of their elective-effective art.

And both have their uses.

Posted in Aesthetics, Artistic Differences, Computability, Effective Description, Ethics, Existential Choice, Finitude, Form, Imagination, Information, Inquiry, Limitation, Logic of Science, Matter, Mortality, Poetry, Programming, Volition | Tagged , , , , , , , , , , , , , , , , , | 1 Comment

I Wonder, Wonder Who

Re: R.J. Lipton and K.W. ReganWho Invented Boolean Functions?

The question recalls recent discussions of discovery and invention in the mathematical field, bringing back to mind questions I’ve wondered about for as long as I can remember.

Speaking as an unreconstructed Platonic realist, I am tempted to say Boolean functions are mathematical objects which cannot be invented, only discovered.  But speaking as a semiotic constructivist I would have to concede we do indeed invent all sorts of syntactic systems for talking and thinking about these mathematical objects.  And some calculi can even be better than others for the purpose of calculation, a fact repaying us to consider the alternatives as they work out in practice.

On the third hand, I have more lately been thinking the concepts of discovery and invention, being human constructs like the proverbial concepts of particles and waves, may not be adequate in the final analysis to articulate the reality of the process at hand.  It may well be all these questions are more like the question —

  • Who discovered Orion in the night sky?
Posted in Anamnesis, Aristotle, Boole, Boolean Functions, C.S. Peirce, Discovery, Invention, Learning, Logic, Mathematics, Meno, Model Theory, Peirce, Plato, Propositional Calculus, Recollection, Semiotics, Socrates, Teaching | Tagged , , , , , , , , , , , , , , , , , , | Leave a comment

Notes On Categories • 1

Continued from “Notes On Categories” (14 Jul 2003) • Inquiry ListOntology List

NB.  This page is a work in progress.  I will have to dig up some still older notes from the days of pen and paper before I can remember how I left things last.

Here are some notes on a computational approach to category theory I started working on back in the 1980s, all of which work as yet remains in the “Schubert Category” of unfinished symphonies.

It helps me a little bit to write the names of categories in the plural, so as not to confuse them with individuals.  It also helps if I treat the arrows of Arr(C) as the primary entities in the category C, recovering the objects of Obj(C) as secondary entities by collecting all the entities that appear in s(f) = Source(f) and t(f) = Target(f) as one ranges over all of the arrows f in Arr(C).

The last time that I tried to do “categories by computer”, I was using data structures that had the following shapes:

   Category C o              
             /|\             
            / | \            
          ... | ...          
              |              
      Arrow f o              
             / \             
            s   t            
           /     \           
     s(f) o       o t(f)     

A functor, then, is something I picture like this:

                   Functor F o                             
                           . | .                           
                         .   |   .                         
                       .     |     .                       
                     .       |       .                     
        Category C o         o         o Category D = CF   
                   |       ./ \.       |                   
                   |     . /   \ .     |                   
                   |   .  /     \  .   |                   
                   | .   /       \   . |                   
           Arrow f o    o         o    o Arrow fF          
                  / \ .   .     .   . / \                  
                 /  .\      . .      /.  \                 
                s .   t     . .     s   . t                
               /.      \  .     .  /      .\               
              o         o         o         o              
              x         y         xF        yF             

This is a rough sketch of the actual data structures that I used to represent a functor F as a “matching” between the parallel items of categories C and D.

NB.  I have reverted to the convention I was accustomed to use at the time, where all operators are applied on the right of their arguments.

What the picture says is that the functor F : CCF takes each arrow f in C to an arrow fF in CF, and each object x in C to an object xF in CF, in such a manner that (fs)F = (fF)s and (ft)F = (fF)t.  To be a functor, F must satisfy the following two systems of equations:

(1x)F   =   1(xF),   for all x in Obj(C).

(fg)F   =   fFgF,   for all composable f, g in Arr(C).

That was just how I kept track of things on the computer.

It is, of course, more usual to draw a functor square in the following manner, where we get one such picture for each object x and arrow f in C.

            F            
     x o-------->o xF    
       |         |       
       |         |       
     f |         | fF    
       |         |       
       v         v       
     y o-------->o yF    
            F            
Posted in Abstraction, Category Theory, Computing, Graph Theory, Logic, Mathematics, Relation Theory, Type Theory | Tagged , , , , , , , | 10 Comments

Theme One • A Program Of Inquiry 4

Re: Next Polymath Project • What, When, Where?

Here’s a bit of data on the Theme One Program I worked on all through the 1980s.  My aim was to develop fundamental algorithms and data structures to support an integrated learning and reasoning interface.  I wrote up a pilot version of the program well enough to get a Master’s degree out of it but still haven’t gotten around to writing up the complete documentation.  Below is a link to what I’ve put on the web so far.

I see this project as being related to Tim Gowers’ Proposal on the Mathematics of the Origin of Life, since one of the reasons for doing this work was to get information about the threshold of systems-theoretic complexity necessary to support a capacity for inquiry.

By the end of the 80s, and especially as I returned to grad school in systems engineering during the 90s, my work on this program gradually morphed into a broader study of what I began calling “Inquiry Driven Systems”.  The conceptual background for this study is outlined in the following proposal.

More discussion to follow as I get time …

Inquiry Project Papers

Posted in Artificial Intelligence, C.S. Peirce, Cognition, Computation, Constraint Satisfaction Problems, Cybernetics, Formal Languages, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Peirce, Semiotics | Tagged , , , , , , , , , , , , , | 8 Comments

Château Descartes

But if we are to select those dimensions which will be of the greatest assistance to our imagination, we should never attend to more than one or two of them as depicted in our imagination, even though we are well aware that there is an indefinite number involved in the problem at issue.  It is part of the method to distinguish as many dimensions as possible, so that, while attending to as few as possible at the same time, we nevertheless proceed to take in all of them one by one.  (Descartes, CSM, 63).

The final point we should bear in mind is that among the dimensions of a continuous magnitude none is more distinctly conceived than length and breadth, and if we are to compare two different things with each other, we should not attend at the same time to more than these two dimensions in any given figure.  For when we have more than two different things to compare, our method demands that we survey them one by one and concentrate on no more than two of them at once.  (Descartes, CSM, 65).

Reference

  • René Descartes, “Regulae ad Directionem Ingenii”, or “Rules for the Direction of the Mind”, pp. 9–78 in John Cottingham, Robert Stoothoff, and Dugald Murdoch (eds., trans., 1985), The Philosophical Writings of Descartes, Volume 1, Cambridge University Press, Cambridge, UK.
Posted in Analytic Geometry, Cartesian Coordinate System, Cartesian Philosophy, Cartesian Product, Descartes, Dualism, Dyadicism, Inquiry, Logic, Mathematics, Philosophy, Reductionism, Relation Theory | Tagged , , , , , , , , , , , , | 3 Comments

The Difference That Makes A Difference That Peirce Makes • 1

Being one who does not view Peirce’s work as a flickering foreshadowing of analytic philosophy, logical whatevism, or anything else you want to call it, but leans more to thinking of the latter philosophies as fumbling fallbacks losing what ground Peirce had gained for our understanding of logic, mathematics, science, not to mention the life of inquiry in general, I am dropping this thread anchor toward the end of remembering the critical insights Peirce gave us, as they come to mind.

cc: Arisbe, Inquiry, Peirce List

Posted in C.S. Peirce, Inquiry, Logic, Mathematics, Philosophy, Pragmatism, Science, Scientific Method, Semiotics | Tagged , , , , , , , , | 1 Comment

Ask Meno Questions • Code Meno Code

Adapted from Prospects for Inquiry Driven Systems

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 form:

What piece of code should be followed in order to discover that code?

It is a classic catch, whose pattern was traced out long ago in the paradox of Plato’s Meno. Discussion of this dialogue and the task it sets for AI, cognitive science, and education, including the design of intelligent tutoring systems, can be found in (H. Gardner, 1985), (Chomsky, 1965, 1972, 1975, 1980, 1986), (Fodor, 1975, 1983), (Piattelli-Palmarini, 1980), and (Collins and Stevens, 1991). Though it appears to mask a legion of diversions, this question will present itself at least twice more in the current engagement, both on the horizon and at the gates of the project to fathom and to build intelligent systems. Therefore, it is worth recalling how this inquiry begins. The interlocutor Meno asks:

Can you tell me, Socrates, whether virtue can be taught, or is acquired by practice, not teaching? Or if neither by practice nor by learning, whether it comes to mankind by nature or in some other way? (Plato, Meno, p. 265).

Whether the word “virtue” (arete) is interpreted to mean virtuosity in some special skill or a more general excellence of conduct, it is evidently easy, in the understandable rush to “knowledge”, to forget or ignore what the primary subject of this dialogue is. Only when the difficulties of the original question, whether virtue is teachable, have been moderated by a tentative analysis does knowledge itself become a topic of the conversation. This hypothetical mediation of the problem takes the following tack:

If virtue is a kind of knowledge, and if every kind of knowledge can be be taught, would it not follow that virtue can be taught?

For the present purpose, it should be recognized that this “trial factorization” of a problem space or phenomenal field is a significant intellectual act in itself, one that deserves attention in the effort to understand the competencies that support intelligent functioning. It is a good question to ask just what sort of reasoning processes might be involved in the ability to find such a middle term, as is served by “knowledge” in the example at hand. Generally speaking, interest will reside in a whole system of middle terms, which might be called a “medium” of the problem domain or field of phenomena. This usage makes plain the circumstance that the very recognition and expression of a problem or phenomenon is already contingent on and complicit with a particular set of hypotheses that will inform the direction of its resolution or explanation.

One of the chief theoretical difficulties that obstructs the unification of logic and dynamics in the study of intelligent systems can be seen in relation to this question of how an intelligent agent might generate tentative but plausible analyses of problems that confront it. As described here, this requires a capacity for identifying middle grounds that ameliorate or mollify a problem. This facile ability does not render any kind of demonstrative argument to be trusted in the end and for all time, but is a temporizing measure, a way of locating test media and of trying cases in the media selected. It is easy to criticize such practices, to say that every argument should be finally cast into a deductively canonized form, harder to figure out how to live in the mean time without using such half-measures of reasoning. There is a line of thinking, extending from this reference point in Plato through a glancing remark by Aristotle to the notice of C.S. Peirce, which holds that the form of reasoning required to accomplish this feat is neither inductive nor deductive and reduces to no combination of the two, but is an independent type.

Aristotle called this form of reasoning apagogy (Prior Analytics, 2.25) and it was variously translated throughout the Middle Ages as reduction or abduction. The sense of reduction here is just that by which one question or problem is said to reduce to another, as in the AI strategy of goal reduction. Abductive reasoning is also involved in the initial creation or apt generation of hypotheses, as in diagnostic reasoning. Thus, it is natural that abductive reasoning has periodically become a topic of interest in AI and cognitive modeling, especially in the effort to build expert systems that simulate and assist diagnosis, whether in human medicine, auto mechanics, or electronic trouble-shooting. Recent explorations in this vein are exemplified by (Peng and Reggia, 1990) and (O’Rorke, 1990).

But there is another reason why the factorization problem presents an especially acute obstacle to progress in the system-theoretic approach to AI. When the states of a system are viewed as a manifold it is usual to imagine that everything factors nicely into a base manifold and a remainder. Smooth surfaces come to mind, a single clear picture of a system that is immanently good for all time. But this is how an outside observer might see it, not how it appears to the inquiring system that is located in a single point and has to discover, starting from there, the most fitting description of its own space. The proper division of a state vector into basic and derivative factors is itself an item of knowledge to be discovered. It constitutes a piece of interpretive knowledge that has a large part in determining exactly how an agent behaves. The tentative hypotheses that an agent spins out with respect to this issue will themselves need to be accommodated in a component of free space that is well under control. Without a stable theater of action for entertaining hypotheses an agent finds it difficult to sustain interest in the kinds of speculative bets that are required to fund a complex inquiry.

States of information with respect to the placement of this fret or fulcrum can vary with time. Indeed, it is a goal of the knowledge directed system to leverage this chordal node toward optimal possibilities, and this normally requires a continuing interplay of experimental variations with attunement to the results. Therefore it seems necessary to develop a view of manifolds in which the location or depth of the primary division that is effective in explaining behavior can vary from moment to moment. The total phenomenal state of a system is its most fundamental reality, but the way in which these states are connected to make a space, with information that metes out distances, portrays curvatures, and binds fibers into bundles — all this is an illusion projected onto the mist of individual states from items of code in the knowledge component of the current state.

The mathematical and computational tools needed to implement such a perspective go beyond the understanding of systems and their spaces that I currently have in my command. It is considered bad form for a workman to blame his tools, but in practical terms there continues to be room for better design. The languages and media that are made available do, indeed, make some things easier to see, to say, and to do than others, whether it is English, Pascal (Wirth, 1976), or Hopi (Whorf, 1956) that is being spoken. A persistent attention to this pragmatic factor in epistemology will be necessary to implement the brands of knowledge-directed systems whose intelligence can function in real time. To provide a computational language that can help to clarify these problems is one of the chief theoretical tasks that I see for myself in the work ahead.

A system moving through a knowledge field would ideally be equipped with a strategy for discovering the structure of that field to the greatest extent possible. That ideal strategy is a piece of knowledge, a segment of code existing in the knowledge space of every point that has this option within its potential. Does discovery mark only a different awareness of something that already exists, a changed attitude toward a piece of knowledge already possessed? Or can it be something more substantial? Are genuine invention and proper extensions of the shared code possible? Can intelligent systems acquire pieces of knowledge that are not already in their possession, or in their potential to know?

If a piece of code is near at hand, within a small neighborhood of a system’s place in a knowledge field, then it is easy to see a relationship between adherence and discovery. It is possible to picture how crumbs of code could be traced back, accumulated, and gradually reassembled into whole slices of the desired program. But what if the required code is more distant? If a system is observed in fact to drift toward increasing states of knowledge, does its disposition toward knowledge as a goal need to be explained by some inherent attraction of knowledge? Do potential fields and propagating influences have to be imagined in order to explain the apparent action at a distance? Do massive bodies of knowledge then naturally form, and eventually come to dominate whole knowledge fields? Are some bodies of knowledge intrinsically more attractive than others? Can inquiries get so serious that they start to radiate gravity?

Questions like these are only ways of probing the range of possible systems that are implied by the definition of a knowledge field. What abstract possibility best describes a given concrete system is a separate, empirical question. With luck, the human situation will be found among the reasonably learnable universes, but before that hope can be evaluated a lot remains to be discovered about what, in fact, may be learnable and reasonable.

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