Comments

Showing posts with label Turing. Show all posts
Showing posts with label Turing. Show all posts

Monday, September 15, 2014

Computations. modularity and nativism

The last post (here) prompted three useful comments by Max, Avery and Alex C. Though they appear to make three different points (Max pointing to Fodor’s thoughts on modularity, Avery on indirect negative evidence and Alex C on domain specific nativism) I believe that they all end up orbiting a similar small set of concerns. Let me explain.

Max links to (IMO) one of Fodor’s best ever book reviews (here). The review brings together many themes in discussing a pair of books (one by Pinker, the other by Plotkin). It outlines some links between computationalism, modularity, nativism and Darwininan natural selection (DNS). I’ll skip the discussion on DNS here, though I know that there will be many of you eager to battle his pernicious and misinformed views (not!).  Go at it.  What I think is interesting given the earlier post is Fodor’s linking together computationalism, modularity and nativism.  How do these ideas talk to one another? Let’s start by seeing what they are.

Fodor takes computationalism to be Turing’s “simply terrific idea” about how to mechanize rationality (i.e. thinking). As Fodor puts it (p. 2):

…some inferences are rational in virtue of the syntax of the sentences that enter into them; metaphorically, in virtue of the ‘shapes’ of these sentences.

Turing noted that, wherever an inference is formal in this sense, a machine can be made to execute the inference. This is because…you can make them [i.e. machines NH] quite good at detecting and responding to syntactic relations among sentences.

 And what makes syntax so nice? It’s LOCAL. Again as Fodor puts it (p. 3):

…Turing’s account of computation…doesn’t look past the form of sentences to their meanings and it assumes that the role of thoughts in a mental process is determined entirely by their internal (syntactic) structure.

Fodor continues to argue that where this kind of locally focused computation is not available, computationalism ceases to be useful.  When does this happen? When belief fixation requires the global canvassing and evaluation of disparate kinds of information all of which have variable and very non-linear effects on the process. Philosophers call this ‘inference to the best explanation’ (IBT) and the problem with IBT is that it’s a complete and utter mystery how it gets done.[1] Again as Fodor puts it (p. 3):

[often] your cognitive problem is to find and adopt whatever beliefs are best confirmed on balance. ‘Best confirmed on balance’ means something like: the strongest and simplest relevant beliefs that are consistent with as many of one’s prior epistemic commitments as possible. But as far as anyone knows, relevance, strength, simplicity, centrality and the like are properties, not of single sentences, but of whole belief systems: and there’s no reason at all to suppose that such global properties of belief systems are syntactic.[2]

And this is where modularity comes in; for modular systems limit the range of relevant information for any given computation and limiting what counts as relevant is critical to allowing one to syntactify a problem and allow computationalism to operate.  IMO, one of the reasons that GG has been a doable and successful branch of cog sci is that FL is modular(ish) (i.e. that something like the autonomy of syntax is roughly correct).  ‘Modular’ means “largely autonomous with respect to the rest of one’s cognition” (p. 3). Modularity is what allows Turing’s trick to operate. Turing’s trick, the mechanization of cognition, relies on the syntacticifcation of inference, which in turn relies on isolating the formal features that computations exploit.

All of which brings us (at last!) to nativism.  Modularity just is domain specificity.  Computations are modular if they are “more or less autonomous” and “special purpose” and “the information [they] can use to solve [cognitive problems] are proprietary” (p. 3).  So construed, if FL is modular, then it will also be domain specific. So if FL is a module (and we have lots of apparent evidence to suggest that it is) then it would not be at all surprising to find that FL is specially tuned to linguistic concerns. And that it exploits and manipulates “proprietary information” and that its computations were specifically “designed” to deal with the specific linguistic information it worries about.  So, if FL is a module, then we should expect it be contain lots of domain specific computational operations, principles and primitives.

How do we go about investigating the if-clause immediately above?  It helps go back to the schema we discussed in the previous post. Recall the general schema in (1) that we used to characterize the relevant problem in a given domain, ‘X’ ranging over different domains.  (2) is the linguistic case.

(1)  PXD -> FX -> GX
(2)  PLD -> FL -> GL

Linguists have discovered many properties of FL.  Before the Minimalist Program (MP) got going, the theories of FL were very linguistically parochial. The basic primitives, operations and principles did not appear to have much to say about other cognitive domains (e.g. vision, face recognition, causal inference). As such it was reasonable to conclude that the organization of FL was sui generis. And to the degree that this organization had to be take as innate (which, recall, was based on empirical arguments about what Gs did) then to that degree we had an argument for innate domain specific principles of FL.  MP has provided (a few) reasons for thinking that earlier theories overestimated the domain specificity of FL’s organization. However, as a matter of fact, the unification of FL with other domains of cognition (or computation) has been very very very modest.  I know what I am hoping for and I try not to confuse what I want to be true with what we have good reason to be true. You should too. Ambitions are one thing, results quite another. How one might go about realizing these MP ambitions?

If (1) correctly characterizes the problem, then one way for arguing against a dedicated capacity is to show that for various values of ‘X,’ FX is the same. So, say we look at vision and language, then were FL = FV we would have an argument that the very same kind of information and operations were cognitively at play in both vision and language.  I confess, that stating things this baldly makes it very implausible that FL does equal FV, but heh, it’s possible. The impressive trick would show how to pull this off (as opposed to simply expressing hopes or making windy assertions that this could be done), at least for some domains. And the trick is not an easy one to execute: we know a lot about the properties of natural language Gs. And we want an FL that explains these very properties. We don’t want a unification with other FXs that sacrifices this hard won knowledge to some mushy kind of “unification” (yes, these are scare quotes) which sacrifices the specifics that we have worked so hard to establish (yes Alex, I’m talking to you). An honest appraisal of how far we’ve come in unifying the principles across modules would conclude that, to date, we have very few results suggesting that FL is not domain specific. Don’t get me wrong: there are reasons to search for such unifications and I for one would be delighted if this happens. But hoping is not doing and ambitions are not achievements. So, if FL is not a dedicated capacity, but is merely the reflection of more general cognitive principles then it should be possible to find FL being the same as some FX (if not vision, then something else) and that this unified FX’ (i.e. which encompasses FL and FX) can derive the relevant Gs with all their wonderful properties given the appropriate PLD. There’s a Nobel prize awaiting such a unification, so hope to it.[3]

It is worth noting that there is tons of standard variety psycho evidence that FL really is modular with respect to other cognitive capacities.  Susan Curtiss (here and here) reviews the wealth of double dissociations between language and virtually any other capacity you might be interested in. Thus, at least in one perfectly coherent sense, FL is a module and so a dedicated special purpose system. Language competence swings independently of visual acuity, auditory facility, IQ, hair color, height, voacab proficiency, you name it. So if one takes such dissociations as dispositive (and it is the gold standard) then FL is a module with all that this entails.

However, there is a second way of thinking about what unification of the cognitive modules consists in and this may be the source of much (what I take to be) confused discussion. In particular, we need to separate out two questions: ‘Is FL a module?’ and ‘Is FL contain linguistically proprietary parts/circuits?’ One can maintain that FL is a module without also thinking that its parts are entirely different from those in every other module.  How so? Well, FL might be composed from the same kinds of parts present in other modules, albeit put together in distinctive ways. Same parts, same computations, different wiring. If this were so, then there would be a sense in which FL is a module (i.e. it has special distinctive proprietary computations etc.), yet when seen at the right grain it shares many (most? All?) of its basic computational features with other domains of cognition. In other words, it is possible that FL’s computations are distinctive and dedicated, and that they are built from the same simple parts found in other modules. Speaking personally, this is how I now understand the Minimalist Bet (i.e. that FL shares many basic computational properties with other systems). 

This is a coherent position (which does not imply it is correct). At the cellular level our organs are pretty similar. Nonetheless, a kidney is not a heart, and neither is a liver or a stomach.  So too with FL and other cognitive “organs.”  This is a possibility (in fact, I have argued in places that this is also plausible and maybe even true). So, seen from the perspective of the basic building blocks, it is possible that FL, though a separate module, is nonetheless “just like” every other kind of cognition. This version of the “modularity” issue asks not whether FL is a domain specific dedicated system (it is!), but whether it employs primitive circuits/operations proprietary to it (i.e. not shared with other cognitive domains). Here ‘domain specific’ means uses basic operations not attested in the other domains of non-linguistic cognition.

Of course, the MP bet is easy to articulate at a general level. What’s hard is to show that it’s true (or even plausible).  As I’ve argued before, to collect on this bet requires, first, reducing FL’s internal modularity (which in turn requires showing Binding, movement, control, agreement, etc. are really only apparently different) and, second, showing that this unification rests on cognitively generic basic operations.[4] Believe me when I tell you that this program has been a hard sell.

Moreover, the mainstream Minimalist position is that though this may be largely correct, it is exactly wrong: there are some special purpose linguistic devices and operations (e.g. Merge), which are responsible for Gs distinctive recursive property. At any rate, I think the logic is clear so I will not repeat the mantra yet again.

This brings me to the last point I want to make: Avery notes that more often than not positive evidence relevant to fixing a grammatical option is missing from the PLD.  In other words, Avery notes that the PLD is in fact even more impoverished than we tend to believe. He rightly notes that this implies that indirect negative evidence (INE) is more important than we tend to think.  Now if he is right (and I have no reason to think that he isn’t), then FL must be chocked full of domain specific information. Why? Because INE requires a sharp specification of options under consideration to be operative.  Induction that uses INE effectively must be richer than induction exploiting only positive data.[5] INE demands more articulated hypothesis space, not less. INE can compensate for poor direct evidence but only if FL knows what absences it’s looking for! You can hear the dogs that don’t bark but only if you are listening for barking dogs. If Avery’s cited example is correct (see here), then it seems that FL is attuned to micro variations, and this suggests a very rich system of very linguistically specific micro parameters internal to FL. Thus, if Avery is right, then FL will contain quite a lot of very domain specific information and given that this information is logically necessary to exploit INE it looks like these options must be innately specified and that FL contains lots of innate domain specific information. Of course, Avery may be wrong and those that don’t like this conclusion are free (indeed urged) to reanalyze the relevant cases (i.e. to indulge in some linguistic research and produce some helpful results).

This is a good place to stop.  There is an intimate connection between modularity, computationalism, and nativism. Computations can only do useful work where information is bounded. Bounded information is what modules provide. More often than not the information that a module exploits is native to it. MP is betting that with respect to FL, there is less language specific basic circuitry than heretofore assumed. However, this does not imply that FL is not a module (i.e. part of “general intelligence”). Indeed, given the kinds of evidence that Curtiss reviews, it is empirically very likely that FL is a module. And this can be true even if we manage to unify the internal modules of FL and demonstrate that the requisite remaining computations largely exploit domain general computational principles and operations. Avery’s important question remains: how much acquisition is driven by direct and how much by indirect negative evidence? Right now, we don’t really know (at least not to the level of detail that we want). That’s why these are still important research topics.  However, the logic is clear, even if the answers are not.



[1] Incidentally, IBT is one of the phenomena that dualists like Descartes pointed to in favor of a distinct mental substance. Dualism, in other words, is roughly the observation that much of thought cannot be mechanized.
[2] It’s important to understand where the problem lies. The problem is not giving a story in specific cases in specific contexts. We do this all the time. The problem is providing principles that select out the IBT antecedent to a specification of the contextually relevant variables. The hard problem is specifying what is relevant ex ante.
[3] Successful unifications almost always win kudos. Think electricity and magnetism, the the latter two with the weak force, terrestrial and celestial mechanics, chemistry and mechanics. These all get their own chapters in the greatest hits of science books. And in each case, it took lots of work to show that the desired unification was possible. There is no reason to think that cognition should be any easier.
[4] I include generic computational principles here, so-called first factor computational principles.
[5] In fact, if I understand Gold correctly (which is a toss up), acquiring modestly interesting Gs strictly using induction over positive data is impossible.

Wednesday, January 15, 2014

Jeff W comments on comments on recursion

I asked Jeff Watumall to respond to some of the points made concerning our previously flagged paper. He was the real driving force behind our joint effort. Thx Jeff. Here's what Jeff has to say.

******


On “On Recursion”

Our paper (http://www.frontiersin.org/Journal/10.3389/fpsyg.2013.01017/abstract) has generated interesting discussion in a previous post (http://facultyoflanguage.blogspot.com/2014/01/more-on-recursion.html).  Here I comment on those comments.

Turing and Gödel:

It is no error to equate Turing computability with Gödel recursiveness.  Gödel was explicit on this point (I am quoting from numerous Gödel papers in his Collective Works; I can furnish references if requested): “A formal system can simply be defined to be any mechanical procedure for producing formulas, called provable formulas[...].  Turing’s work gives an analysis of the concept of ‘mechanical procedure’ (alias ‘algorithm’ or ‘computation procedure’ or ‘finite combinatorial procedure’).  This concept is shown to be equivalent with that of a ‘Turing machine.’”  It was important to Gödel that the notion of formal system be defined so that his incompleteness results could be generalized: “That my [incompleteness] results were valid for all possible formal systems began to be plausible for me[.]  But I was completely convinced only by Turing’s paper.”  This clearly holds for the primitive recursive functions: “[primitive] recursive functions have the important property that, for each given set of values of the arguments, the value of the function can be computed by a finite procedure.”  And even prior to Turing, Gödel saw that “the converse seems to be true if, besides [primitive] recursions [...] recursions of other forms (e.g., with respect to two variables simultaneously) are admitted [i.e., general recursions].”  However, pre-Turing, Gödel thought that “[t]his cannot be proved, since the notion of finite computation is not defined, but it serves as a heuristic principle.”  But Turing proved the true generality of Gödel recursiveness.  As Gödel observed: “The greatest improvement was made possible through the precise definition of the concept of finite procedure, which plays a decisive role in these results [on the nature of formal systems].  There are several different ways of arriving at such a definition, which, however, all lead to exactly the same concept.  The most satisfactory way, in my opinion, is that of reducing the concept of finite procedure to that of a machine with a finite number of parts, as has been done by the British mathematician Turing.”  Elsewhere Gödel wrote: “In consequence of [...] the fact that due to A.M. Turing’s work a precise and unquestionably adequate definition of the general notion of formal system can now be given, a completely general version of Theorems VI and XI [of the incompleteness proofs] is now possible.” 

Intension and Extension:

Properly formulated formal systems can be understood as intensionally and extensionally equivalent to Turing machines.  In such systems the axiomatic derivations correspond to the elementary computation steps (e.g., reading/writing); this is as constructive as a Turing machine.  (There exists a machine that directly performs derivations in the formal system rather than encoding the information in binary strings to be manipulated by the machine.)  Accordingly, Gödel did not see formal systems and Turing machines as simply extensionally equivalent: a formal system is as constructive as a proof: “We require that the rules of inference, and the definitions of meaningful formulas and axioms, be constructive; that is, for each rule of inference there shall be a finite procedure for determining whether a given formula B is an immediate consequence (by that rule) of given formulas A1, ..., An[.]  This requirement for the rules and axioms is equivalent to the requirement that it should be possible to build a finite machine, in the precise sense of a ‘Turing machine,’ which will write down all the consequences of the axioms one after the other.”  This equivalence of formal systems with Turing machines established an absoluteness: “It may be shown that a function which is computable in one of the systems Si or even in a system of transfinite type, is already computable in S1.  Thus, the concept ‘computable’ is in a certain definite sense ‘absolute,’ while practically all other familiar metamathematical concepts depend quite essentially on the system with respect to which they are defined.”  Gödel saw it as “a kind of miracle that”, in this equivalence of computability and recursiveness, “one has for the first time succeeded in giving an absolute definition of an interesting epistemological notion, i.e., one not depending on the formalism chosen.”  Emil Post went further into ontology: The success of proving these equivalences raises Turing-computability/Gödel-recursiveness “not so much to a definition or to an axiom but to a natural law” (Post 1936: 105).  As a natural law, computability/recursiveness applies to any computational system, including a generative grammar.

Rules and Lists:

The important aspect of the recursive-function/lookup-table distinction is not computability per se (table look-up is trivially computable) but explanation.  A recursive function derives--and thus explains--a value.  A look-up table stipulates--and thus does not explain--a value.  (The recursive function establishes epistemological and ontological foundations.)  Turing emphasized this distinction, with characteristic wit, in discussing “Solvable and Unsolvable Problems” (1954).  Imagine a puzzle-game with a finite number of movable squares. “Is there a systematic way of [solving the puzzle?]  It would be quite enough to say: ‘Certainly [b]y making a list of all the positions and working through all the moves, one can divide the positions into classes, such that sliding the squares allows one to get to any position which is in the same class as the one started from.  By looking up which classes the two positions belong to one can tell whether one can get from one to the other or not.’  This is all, of course, perfectly true, but one would hardly find such remarks helpful if they were made in reply to a request for an explanation of how the puzzle should be done.  In fact they are so obvious that under the circumstances one might find them somehow rather insulting.”  Indeed.  A look-up table is arbitrary; it is equivalent to a memorized or genetically preprogrammed list.  This may suffice for, say, nonhuman animal communication, but not natural language.  This is particularly important for an infinite system (such as language), for as Turing explains: “A finite number of answers will deal with a question about a finite number of objects,” such as a finite repertoire of memorized/preprogrammed calls.  But “[w]hen the number is infinite, or in some way not yet completed[...], a list of answers will not suffice.  Some kind of rule or systematic procedure must be given.”  Gallistel and King (2009: xi) follow Turing’s logic: “a compact procedure is a composition of functions that is guaranteed to generate (rather than retrieve, as in table look-up) the symbol for the value of an n-argument function, for any arguments in the domain of the function.  The distinction between a look-up table and a compact generative procedure is critical for students of the functional architecture of the brain.  One widely entertained functional architecture, the neural network architecture, implements arithmetic and other basic functions by table look-up of nominal symbols rather than by mechanisms that implement compact procedures on compactly encoded symbols.”

Iteration and Tail Recursion:


This is mathematics, not computer science.  (Or, rather, I am a mathematician, now interloping in linguistics.  In mathematics, iteration--a general notion applicable to a pattern of succession--is seen as a form of recursion: the function f is defined for an argument x by a previously defined value (e.g., f(y), y < x); but iteration is “tail” recursion given that the previously defined value y is the immediately previously define value.)  We are on the computational level, not the level of mechanisms.  It is important to recall that Marr and Nishihara (1978) distinguished four--not three--levels: “At the lowest, there is the basic component and circuit analysis--how do transistors (or neurons), diodes (or synapses) work?  The second level is the study of particular mechanisms: adders, multipliers, and memories, these being assemblies made from basic components.  The third level is that of the algorithm, the scheme for a computation; and the top level contains the theory of computation.”  (The theory of computation is mathematical.)  Much of the muddling of iteration and tail recursion in the comments on the previous post is the result of misclassifying the level of analysis.  “[W]e may consider the study of grammar and UG to be at the level of the theory of computation” (Chomsky 1980: 48).  Thus discussion of loops, arrays, etc. is irrelevant.  In fact, algorithms and mechanisms are arguable irrelevant in principle.  We concur with Chomsky that, for the computational system of language “there’s no algorithm for the system itself; it’s kind of a category mistake.  [T]here’s no calculation of knowledge; it’s just a system of knowledge[...].  You don’t ask the question what’s the process defined by Peano’s axioms and the rules of inference, there’s no process” (Chomsky 2013a).  Analogously, a Turing machine is not a description of a process or algorithm or mechanism but “a mathematical characterization of a class of numerical functions” (in the words of Martin David (1958: 3), one of the founders of computability theory).  Thus to define the faculty of language as a type of Turing machine as we did in our paper, “On Recursion,” is to give a function: “a finite characterization of an infinite set” (Chomsky 2013b).  A Turing machine--and thus the language faculty--is defined by a tuple containing a finite set of symbols (axioms), a set of states (with “states” defined as “structures” in the sense of mathematical logic), and a transition function (rule of inference) mapping from state/symbol to state/symbol.  “A derivation is thus roughly analogous to a proof with Σ,” a finite set of initial symbols, “taken as the axiom system and F,” the finite set of rewrite rules (or Merge), “[taken] as the rules of inference” (Chomsky 1956: 117), consistent with Gödel’s characterization: “We require that the rules of inference, and the definitions of meaningful formulas and axioms, be constructive; that is, for each rule of inference there shall be a finite procedure for determining whether a given formula B is an immediate consequence (by that rule) of given formulas A1, ..., An[.]  This requirement for the rules and axioms is equivalent to the requirement that it should be possible to build a finite machine, in the precise sense of a ‘Turing machine,’ which will write down all the consequences of the axioms one after the other.

Wednesday, March 20, 2013

Guest Post: Jeffrey Watumull on Postal's Critique of Biolinguistics

Jeff Watumull send me an early version of the following and I immediately asked him if I could post it. It is a vigorous rebuttal of Postal's argument outlined in several of his more recent papers.  An earlier post on a similar topic generated a lot of interest and discussion. Jeff here argues (convincingly in my view) that Platonism and the biolinguistic program are perfectly compatible. If correct, and I will let you dear readers judge for yourselves, there is even less to Postal's Platonist critique of the biolinguistic program than I earlier conceded. Jeff argues that Postal's critique is a non-sequitur even on its Platonist own assumptions. The good news: if you find Platonism appealing you can still be a good biolinguist.  Whew! Thanks Jeff. Enjoy the piece. Oh yes, the post is on the long side. That's the price you pay for a comprehensive critique.




Biolinguistics and Platonism: Contradictory or Consilient?

Jeffrey Watumull
(watumull@mit.edu)

1 Introduction

In “The Incoherence of Chomsky’s ‘Biolinguistic’ Ontology” (Postal 2009), Postal attacks biolinguistics as “junk linguistics” (Postal 2009: 121) with an “awful” (Postal 2009: 114) ontology expounded in “gibberish” (Postal 2009: 118), the “persuasive fore of [which] has been achieved only via a mixture of intellectual and scholarly corruption” (Postal 2009: 104), whereas writings espousing Postal’s ontology “manifest substance and quality of argument at an incomparably higher intellectual level than [Chomsky’s]” (Postal 2009: 105).  As a proponent of biolinguistics, I am tempted to reply in kind to such invective, but to do so would be bad form and bad science.  A fallacy free and dispassionate—if disputatious—rebuttal is necessary and proper.

For Postal, language is a Platonic object, and therefore he concludes that the biolinguistic assumption of a physical basis for language is “absurd” (Postal 2009: 104).  To the contrary, I shall show Postal’s conclusion to be a non sequitur.

By engaging in this argument, I fully expect Postal to accuse me of having “chosen to defend something [i.e., biolinguistics] its own author [i.e., Chomsky] is unwilling to” (Postal 2009: 105), from which two conclusions necessarily follow in Postal’s mind: (i) I am a living testament to Chomsky’s “intellectual and scholarly corruption” of the youth; and (ii) “By exercising his undeniable right of silence here, Chomsky leaves unimpeded the inference that he has not attempted a refutation because he cannot” (Postal 2009: 105).  It goes without saying that I reject these conclusions and the premise from which they do not follow.  (Incidentally, (i) corrupting the young has noble precedents (e.g., a case from 399 BCE) and (ii) the argumentum a silentio is a classic fallacy.)

This is not an apologia for Chomsky.  Biolinguistics has no single author: it is a research program pursued by numerous individually-thinking scientists subordinate to no individual however foundational and influential.  Moreover the theoretical and empirical contributions of the diverse subprograms in which these scientists work are so numerous and important that none can be “dominant” (Postal 2009: 104): in the intersection of cognitive science, linguistics, and the formal sciences, the formal properties and functional architecture of linguistic cognition are being specified; evolutionary biology is investigating possible homologues/analogues of language in nonhuman animals; genetics is discovering some of the genes entering into the development and operation of the language faculty; neuroscience is mapping the physical substrate of linguistic processing; and this is but a subset of the biolinguistics program to “reinstate the concept of the biological basis of language capacities” (Lenneberg 1967: viii).

The subprogram I work in, call it mathematical biolinguistics, is so theoretically and empirically eclectic that I am naturally interested in its ontology.  It therefore cannot be “odd for [Postal’s] opposite in the present exchange to be anyone other than Chomsky” (Postal 2009: 105). 

In the next section I very briefly and very informally define the biolinguistics Postal impugns.  The third section is a rehearsal of Postal’s arguments for linguistic Platonism and ipso facto (so he assumes) against biolinguistics.  I proceed in the fourth section to analyze some of the flaws in these arguments, demonstrating that the ontologies of Platonism and biolinguistics—properly defined—are not mutually exclusive and contradictory, but in fact mutually reinforcing and consilient in a coherent and compelling philosophy of language.

I must add that my work and the ontology it assumes are not representative of all biolinguistic research.  Many would accept my thesis that, just as engineers have encoded abstract software into concrete hardware, evolution has encoded within the neurobiology of Homo sapiens sapiens a formal system (computable functions) generative of an infinite set of linguistic expressions, modulo my understanding of the formal system as a Platonic object.  Nor is mine the only coherent interpretation of biolinguistics.  So it must not be thought that someone with my philosophy is the only possible “opposite [to Postal] in the present exchange.”

2 Biolinguistics

Let the ontology of some research program be defined as “biolinguistic” if it assumes, investigates, and is informed by the biological basis of language—a definition subsuming many productive programs of research in the formal and natural sciences.  But so general a definition cannot adjudicate the case with Postal.  At issue here is the particular definition of biolinguistics that identifies language as I-language—i.e., a computational system (a function in intension) internal to the cognitive/neurobiological architecture of an individual of the species Homo sapiens sapiens—the properties of which are determined by the three factors that enter into the design of any biological system: genetics, external stimuli, and laws of nature.

That Chomsky invented the term I-language and has expatiated on the three factors does not render him the “author” (Postal 2009: 105) of biolinguistics—that would be a category error analogous to attributing “authorship” of evolutionary biology to Darwin given his invention of the term natural selection and expatiation on the factors entering into common descent with modification.  Biolinguistics and evolutionary biology are research programs to investigate objects and processes of nature.  Thus the only author of I-language is nature.  And thus anyone is free to recognize the ontology of biolinguistics as here defined.

3 Platonist Ontology

The incoherence of the biolinguistic ontology is claimed to derive from the fact that “there can be no such thing” (Postal 2009: 105) as biolinguistics, which assumes that “a mentally represented grammar and [the language-specific genetic endowment] UG are real objects, part of the physical world, where we understand mental states and representations to be physically encoded in some manner [in the brain].  Statements about particular grammars or about UG are true or false statements about steady states attained or the initial state (assumed fixed for the species), each of which is a definite real-world object, situated in space-time and entering into causal relations” (Chomsky 1983: 156-157).  To Postal, this ontology is as “absurd” as a “biomathematics” or a “biologic,” for “Were mathematics biological, brain research might resolve such questions as whether Goldbach’s Conjecture is true.  Were logic biological, one might seek grants to study the biological basis of the validity of Modus Ponens.  The ludicrous character of such potential research is a measure of the folly of the idea that these fields study biological things” (Postal 2009: 104, 105).
           
By analogy, Postal argues that the objects of linguistic inquiry are not physical (a fortiori not biological), but rather “like numbers, propositions, etc. are abstract objects, hence things not located in space and time, indeed not located anywhere.  They are also things which cannot be created or destroyed, which cannot cause or be caused.  [Natural languages] are collections of other abstract objects normally called sentences, each of which is a set” (Postal 2009: 105). 

In the paper under consideration, Postal does not expound this ontology (see Postal 2004); a “brief exposition of its essence” (Postal 2009: 106) suffices for his and my purposes.  Essential to the ontology—a form of linguistic Platonism—are the type/token distinction and discrete infinity.

3.1 Types/Tokens

“ES IST DER GEIST DER SICH DEN KORPER BAUT: [S]uch is the nine word inscription on a Harvard museum.  The count is nine because we count der both times; we are counting concrete physical objects, nine in a row.  When on the other hand statistics are compiled regarding students’ vocabularies, a firm line is drawn at repetitions; no cheating.  Such are two contrasting senses in which we use the word word.  A word in the second sense is not a physical object, not a dribble of ink or an incision in granite, but an abstract object.  In the second sense of the word word it is not two words der that turn up in the inscription, but one word der that gets inscribed twice.  Words in the first sense have come to be called tokens; words in the second sense are called types” (Quine 1987: 216-217).

The distinction applies to sentences: for instance, in the classic story by Dr. Seuss, there exist (by my quick count) six tokens of the one type I do not like green eggs and ham.  Postal defines sentence tokens and types as the objects of inquiry for biolinguistics and linguistic Platonism, respectively.  For biolinguistics, as Postal understands it, a sentence is nothing more than a “brain-internal token” (Postal 2009: 107)—a mental representation.  Such an object is defined by spatiotemporal (neurobiological) coordinates with causes (cognitive, chemical, etc.) and effects (e.g., in reasoning and communication).  For linguistic Platonism, as Postal understands it, this physical object is (if anything) a token of an abstract type, with only the latter being really real.  Empirically, “island constraints, conditions on parasitic gaps, binding issues, negative polarity items, etc.” obtain not of physical objects per se, but of abstractions: “Where is the French sentence Ça signifie quoi? — is it in France, the French Consulate in New York, President Sarkozy’s brain?  When did it begin, when will it end?  What is it made of physically?  What is its mass, its atomic structure?  Is it subject to gravity?  Such questions are nonsensical because they advance the false presumption that sentences are physical objects” (Postal 2009: 107).  For Postal this nonsense is nonfinite.

3.2 Discrete Infinity

“[T]he most elementary property of language—and an unusual one in the biological world—is that it is a system of discrete infinity consisting of hierarchically organized objects” (Chomsky 2008: 137).  “Any such system is based on a primitive operation that takes n objects already constructed, and constructs from them a new object: in the simplest case, the set of these n objects” (Chomsky 2005: 11).  Call [the operation] Merge.  Operating without bounds, Merge yields a discrete infinity of structured expressions” (Chomsky 2007: 5). 

Postal invokes the type/token distinction in his critique of this biolinguistic conception of discrete infinity.  He assumes that any object constructed by a physical system must be physical: “Consider a liver and its production of bile, a heart and its production of pulses of blood; all physical and obviously finite.  And so it must be with any cerebral physical production” (Postal 2009: 109).  Thus if language is a physical (neurobiological) system, then its productions (sentences) must be physical (neurobiological tokens).  But physical objects are by definition bounded by the finiteness of spatiotemporal and operational resources: “There is for Chomsky thus no coherent interpretation of the collection of brain-based expressions being infinite, since each would take time and energy to construct, [...] store, process, or whatever[...]; they have to be some kind of tokens” (Postal 2009: 109, 111).  More abstractly, a discretely (denumerably) infinite set is one with expressions (members) that can be related one-to-one with the expressions of one of its subsets (and with the natural numbers).  But if language is a neurobiological system, hence finite, then obviously it cannot contain or construct a set that can be related to the (countable) infinity of natural numbers: “every physical production takes time, energy, etc. and an infinite number of them requires that the physical universe be infinite and, internal to Chomsky’s assumptions, that the brain be” (Postal 2009: 111).  Reductio ad absurdum, supposedly.
           
If biolinguistics implies that expressions are bounded by the spatiotemporal and operational resources of neurobiology, then the (infinite) majority of expressions contained in the discrete infinity are generable only in principle: there exist infinitely many more possible sentences than can ever be generated in the physical universe.  So for the biolinguistic system to be defined as discretely infinite, it must be defined as an idealization: a system abstracted away from the contingent nature of the spatiotemporal and operational resources of neurobiology.  In other words, the biolinguistic system is discretely infinite only if abstracted from biology.  And this, Postal concludes, is the fundamental fallacy: 

If “the biological [Merge function] ‘ideally’ generates an infinite collection, most of the ‘expressions’ in the collection cannot be physical objects, not even ones in some future, and the [natural language] cannot be one either.  [A]lmost all sentences are too complex and too numerous [...] to be given a physical interpretation[...].  In effect, a distinction is made between real sentences and merely ‘possible’ ones, although this ‘possibility’ is unactualizable ever in the physical universe.  According to the biological view, [...] the supposedly ‘possible’ sentences are, absurdly, actually biologically impossible.  Thus internal to this ‘defense’ of Chomsky’s biolinguistic view, the overwhelming majority of sentences cannot be assigned any reality whatever internal to the supposed governing ontology.  This means the ontology can only claim [natural language] is infinite because, incoherently, it is counting things the ontology cannot recognize as real” (Postal 2009: 111).
 
If, however, tokens as physical objects can implement abstract types, then presumably a recursive rule—a finite type—could be tokenized as a procedure in the mind/brain.  This Postal concedes: although “nothing physical is a rule or recursive,” because recursive rules are Platonic, a “physical structure can encode rules” (Postal 2009: 110).  Presumably therefore Merge—the mentally-represented/neurobiologically-implemented recursive procedure posited in biolinguistics to generate discrete infinity—is a legitimate posit.  But Postal objects: “an interpretation of physical things as representing particular abstractions [is] something Chomsky’s explicit brain ontology has no place for” (Postal 2009: 110).  Furthermore, Merge is supposed to generate sets, and sets are Platonic abstractions, but as “an aspect of the spatiotemporal world, [Merge] cannot ‘generate’ an abstract object like a set” (Postal 2009: 114).  So Merge is either biological—not mathematical and hence incapable of generating a set (let alone an infinite one)—or it is mathematical—hence nonbiological but capable of generating discrete infinity.  In sum, language is either physical or it is Platonic, and only under the latter definition can it be predicated of that “most elementary property,” discrete infinity—or so Postal maintains.
   
4 Mathematical Biolinguistic Ontology

Let me affirm at the outset my commitment to mathematical Platonism, which informs my biolinguistic ontology in ways to be discussed.  More strongly than Chomsky, who does grant mathematical Platonism “a certain initial plausibility,” I am convinced of the existence of “a Platonic heaven [of] arithmetic and [...] set theory,” inter alia, that “the truths of arithmetic are what they are, independent of any facts of individual psychology, and we seem to discover these truths somewhat in the way that we discover facts about the physical world” (Chomsky 1986: 33).  It follows from this position that I must be committed to linguistic Platonism for any linguistic objects reducible to or properly characterized as mathematical objects.  And indeed in my theory of natural language (see Watumull 2012), the quiddities that define a system as linguistic are ultimately mathematical in nature.  (The “essence” of language, if you will, is mathematical—a proposition I shall not defend here, assuming it to be essentially correct, for at issue in this discussion is not whether the proposition is true, but whether it is consistent with a biolinguistic ontology if true.) 

4.1 Overlapping Magisteria

I and others (see, e.g., Hauser, Chomsky, Fitch 2002; Watumull, Hauser, Berwick 2013) posit a recursive function generative of structured sets of expressions as central to natural language; this function is defined in intension as internal to the mind/brain of an individual of the species Homo sapiens sapiens.  So conceived, I-language has mathematical and biological aspects. 

Nonsense!  Postal would spout: The ontologies of mathematics and biology are nonoverlapping magisteria!  Assuming mathematical Platonism, I concur that a mathematical object per se such as a recursive function (the type) is not physical.  However even Postal (2009: 110) concedes that such an object can be physically encoded (as a token).  The rules of arithmetic for instance are multiply realizable, from the analog abacus to the digital computer to the brain; mutatis mutandis for other functions, sets, etc.  And mutatis mutandis for abstract objects definable as mathematical at the proper level of analysis, such as a computer program:

            “You know that if your computer beats you at chess, it is really the program that has beaten you, not the   silicon atoms or the computer as such.  The abstract program is instantiated physically as a high-level  behaviour of vast numbers of atoms, but the explanation of why it has beaten you cannot be expressed without also referring to the program in its own right.  That program has also been instantiated, unchanged, in a long chain of different physical substrates, including neurons in the brains of the programmers and radio waves when you downloaded the program via wireless networking, and finally as states of long- and   short-term memory banks in your computer.  The specifics of that chain of instantiations may be relevant to     explaining how the program reached you, but it is irrelevant to why it beat you: there, the content of the     knowledge (in it, and in you) is the whole story.  That story is an explanation that refers ineluctably to abstractions; and therefore those abstractions exist, and really do affect physical objects in the way required by the explanation” (Deutsch 2011: 114-115).
 
(Though I shall not rehearse the argument here, I am convinced by Gold (2006) that “mathematical objects may be abstract, but they’re NOT [necessarily] acausal” because they can be essential to—ineliminable from—causal explanations.  The potential implications of this thesis for linguistic Platonism are not uninteresting.)

I take the multiple realizability of the chess program to evidence the reality of abstractions as well as anything can (and I assume Postal would agree): something “substrate neutral” (Dennett 1995) is held constant across multiple media.  That something I submit is a computable function; equivalently, that constant is a form of Turing machine (the mathematical abstraction representing the formal properties and functions definitional of—and hence universal to—any computational system). 

4.2 The Linguistic Turing Machine

Within mathematical biolinguistics, it has been argued that I-language is a form of Turing machine (see Watumull 2012; Watumull, Hauser, Berwick 2012), even by those Postal diagnoses as allergic to such abstractions: 

“[E]ven though we have a finite brain, that brain is really more like the control unit for an infinite computer.  That is, a finite automaton is limited strictly to its own memory capacity, and we are not.  We are like a Turing machine in the sense that although we have a finite control unit for a brain, nevertheless we can use indefinite amounts of memory that are given to us externally[, say on a “tape,”] to perform more and more complex computations[...].  We do not have to learn anything new to extend our capacities in this way” (Chomsky 2004: 41-42).

As Postal would observe, this “involves an interpretation of physical things as representing particular abstractions,” which he concedes is coherent in general because obviously “physical structure can encode rules” and other abstract objects (e.g., recursive functions) (Postal 2009: 110)—computer programs, I should say, are a case in point.

4.3 Idealization

Postal (2012: 18) has dismissed discussion of a linguistic Turing machine as “confus[ing] an ideal machine[...], an abstract object, with a machine, the human brain, every aspect of which is physical.”  I-language qua Turing machine is obviously an idealization, with its unbounded running time and access to unbounded memory, enabling unbounded computation.  And obviously “[unboundedness] denotes something physically counterfactual as far as brains and computers are concerned.  Similarly, the claim ‘we can go on indefinitely’ [...] is subordinated to the counterfactual ‘if we just have more and more time.’  Alas we do not, so we can’t go on indefinitely” (Postal 2012: 18).  Alas it is Postal who is confused.

4.3.1 Indefinite Computation
           
Postal’s first confusion is particular to the idealization of indefinite computation.  Consider arithmetic.  My brain (and presumably Postal’s) and my computer encode a program (call it ADD) that determines functions of the form fADD(X + Y) = Z (but not W) over an infinite range.  Analogously, my brain (and Postal’s) but not (yet) my computer encodes a program (call it MERGE) that determines functions of the form fMERGE(α, β) = {α, β}—with syntactic structures assigned definite semantic and phonological forms—over an infinite range.  These programs are of course limited in performance by spatiotemporal constraints, but the programs themselves—the functions in intension—retain their deterministic form even as physical resources vary (e.g., ADD determines that 2 + 2 = 4 independent of performance resources).  

Assuming a mathematical biolinguistic ontology, I-language is a cognitive-neurobiological token of an abstract type; it “generates” sets in the way axioms “generate” theorems.  As the mathematician Gregory Chaitin observes, “theorems are compressed into the axioms” so that “I think of axioms as a computer program for generating all theorems” (Chaitin 2005: 65).  Consider how a computer program explicitly representing the Euclidean axioms encodes only a finite number of bits; it does not—indeed cannot—encode the infinite number of bits that could be derived from the postulates, but it would be obtuse to deny that such an infinity is implicit (compressed) in the explicit axioms.  Likewise, zn+1 = zn2 + c defines the Mandelbrot set (as I-language defines the set of linguistic expressions) so that the infinite complexity of the latter really is implicitly represented in the finite simplicity of the former. 

So while it is true that physically we cannot perform indefinite computation, we are endowed physically with a competence that does define a set that could be generated by indefinite computation.  (A subtle spin on the notion of competence perhaps more palatable to Postal defines it as “the ability to handle arbitrary new cases when they arise” such that “infinite knowledge” defines an “open-ended response capability” (Tabor 2009: 162).)  Postal must concede the mathematical truth that linguistic competence, formalized as a function in intension, does indeed define an infinite set.  However, he could contest my could as introducing a hypothetical that guts biolinguistics of any biological substance, but that would be unwise. 

Language is a complex phenomenon: we can investigate its computational (mathematical) properties independent of its biological aspects just as legitimately as we can investigate its biological properties independent of its social aspects (with no pretense to be carving language at its ontological joints).  In each domain, laws—or, at minimum, robust generalizations—license counterfactuals (as is well understood in the philosophy of science).  In discussing indefinite computation, counterfactuals are licensed by the laws expounded in computability theory:

“[T]he question whether a function is effectively computable hinges solely on the behavior of that function in neighborhoods of infinity[...].  The class of effectively computable functions is obtained in the ideal case where all of the practical restrictions on running time and memory space are removed.  Thus the class is a theoretical upper bound on what can ever in any century be considered computable” (Enderton 1977: 530).

A theory of linguistic competence establishes an “upper bound,” or rather delineates the boundary conditions, on what can ever be considered a linguistic pattern (e.g., a grammatical sentence).  Some of those patterns extend into “neighborhoods of infinity” by the iteration of a recursive function.  Tautologically, those neighborhoods are physically inaccessible, but that is irrelevant.  What is important is the mathematical induction from finite to infinite: Merge applies to any two arguments to form a a set containing those two elements such that its application can only be bounded by stipulation.  In fact a recursive function such as Merge characterizes the “iterative conception of a set,” with sets of discrete objects “recursively generated at each stage,” such that “the way sets are inductively generated” is formally equivalent to “the way the natural numbers [...] are inductively generated” (Boolos 1971: 223). 

The natural numbers are subsumed in the computable numbers, “the real numbers whose expressions as a decimal are calculable by finite means” (Turing 1936: 230).  (The phrase “finite means” should strike a chord with many language scientists.)  It was by defining the computable numbers that Turing proved the coherency of a finitary procedure generative of an infinite set.

“For instance, there would be a machine to calculate the decimal expansion of π[...].  π being an infinite decimal, the work of the machine would never end, and it would need an unlimited amount of working space on its ‘tape’.  But it would arrive at every decimal place in some finite time, having used only a finite quantity of tape.  And everything about the process could be defined by a finite table[...].  This meant that [Turing] had a way of representing a number like π, an infinite decimal, by a finite table.  The same would be true of the square root of three, or the logarithm of seven—or any other number defined by some rule” (Hodges 1983: 100).

Though they have not been sufficiently explicitly acknowledged as such, Turing’s concepts are foundational to the biolinguistic program.  I-language is a way of representing an infinite set by a finite table (a function).  The set of linguistic expressions being infinite, “the work of the machine would never end,” but Postal must concede that nevertheless I-language “would arrive at every [sentence] in some finite time, having used only a finite quantity of tape.  And everything about the process could be defined by a finite table.”  This gives a rigorous sense to the linguistic notion “infinite use of finite means.”  

4.3.1.1 Generation and Explanation

But for all the foregoing, the finitude/infinitude distinction is not so fundamental given the fact that “[a] formal system can simply be defined to be any mechanical procedure for producing formulas” (Gödel 1934: 370).  The infinitude of the set of expressions generated is not as fundamental as the finitude of I-language (the generative function) for the following reason: it is only because the function is finite that it can enumerate the elements of the set (infinite or not); and such a compact function could be—and ex hypothesi is—neurobiologicall encoded.  Even assuming Postal’s ontology in which “[natural languages] are collections of [...] abstract objects” (Postal 2009: 105), membership in these collections is granted (and thereby constrained) by the finitary procedure, for not just any (abstract) object qualifies.  In order for an object to be classified as linguistic, it must be generated by I-language; in other words, to be a linguistic object is to be generated by I-language.  And thus I-language explains why a given natural language contains the member expressions it does. 
           
This notion of I-language as explanation generalizes to the notion of formal system as scientific theory:

“I think of a scientific theory as a binary computer program for calculating observations, which are also written in binary.  And you have a law of nature if there is compression, if the experimental data is compressed into a computer program that has a smaller number of bits than are in the data that it explains.  The greater the degree of compression, the better the law, the more you understand the data.  But if the experimental data cannot be compressed, if the smallest program for calculating it is just as large as it is [...], then the data is lawless, unstructured, patternless, not amenable to scientific study, incomprehensible. In a word, random, irreducible” (Chaitin 2005: 64).

This notion is particularly important, as Turing (1954: 592) observed, “[w]hen the number is infinite, or in some way not yet completed [...],” as it is for the discrete infinity (unboundedness) of language; “a list of answers will not suffice.  Some kind of rule or systematic procedure must be given.”  Otherwise the list is arbitrary and unconstrained.  So for linguistics, in reply to the question “Why does the infinite natural language L contain the expressions it does?” we answer “Because it is generated by the finite I-language f.”  Thus I-language can be conceived of as the theory explicative of linguistic data because it is the mechanism (Turing machine) generative thereof.

4.3.2 “the thing in itself”

Second, with respect to idealization generally, for mathematical biolinguistics to have defined I-language as a Turing machine is not to have confused the physical with the abstract, but rather to have abstracted away from the contingencies of the physical, and thereby discovered the mathematical constants that must of necessity be implemented for any system—here biological—to be linguistic (on my theory).  This abstraction from the physical is part and parcel of the methodology and, more importantly, the metaphysics of normal science, which proceeds by the “making of abstract mathematical models of the universe to which at least the physicists give a higher degree of reality than they accord the ordinary world of sensation” (Weinberg 1976: 28).  The idealization is the way things really are.  Consider Euclidean objects: e.g., dimensionless points, breadthless lines, perfect circles, and the like.  These objects do not exist in the physical world.  The points, lines, and circles drawn by geometers are but imperfect approximations of abstract Forms—the objects in themselves—which constitute the ontology of geometry.  For instance, the theorem that a tangent to a circle intersects the circle at a single point is true only of the idealized objects; in any concrete representation, the intersection of the line with the circle cannot be a point in the technical sense as “that which has no part,” for there will always be some overlap.  As Plato understood (Republic VI: 510d), physical reality is an intransparent and inconstant surface deep beneath which exist the pellucid and perfect constants of reality, formal in nature:

            “[A]lthough [geometers] use visible figures and make claims about them, their thought isn’t directed to them but to the originals of which these figures are images.  They make their claims for the sake of the Square itself and the Diagonal itself, not the particular square and diagonal they draw; and so on in all cases.  These figures that they make and draw, of which shadows and reflections in water are images, they now in turn use as images, in seeking to behold those realities—the things in themselves—that one cannot comprehend except by means of thought.”

Analogously, any particular I-language (implemented in a particular mind/brain) is an imperfect representation of a form (or Form) of Turing machine.  But, Postal would object, the linguistic Turing machine is Platonic, hence nonbiological, and hence bio-linguistics is contradictory.  But, I should rebut, this objection is a non sequitur.
           
I am assuming (too strongly perhaps) that fundamentally a system is linguistic in virtue of mathematical (nonbiological) aspects.  Nevertheless, in our universe, the only implementations of these mathematical aspects yet discovered (or devised) are biological; indeed the existence of these mathematical systems is known to us only by their biological manifestations—i.e., in our linguistic brains and behaviors—which is reason enough to pursue bio-linguistics.  To borrow some rhetorical equipment, biology is the ladder we climb to the “Platonic heaven” of linguistic Forms, though it would be scientific suicide to throw the ladder away once up it.  That chance and necessity—biological evolution and mathematical Form—have converged to form I-language is an astonishing fact in need of scientific explanation.  It is a fact that one biological system (i.e., the human brain) has encoded within it and/or has access to Platonic objects.  (Postal must assume that our finite brains can access an infinite set of Platonic sentences.  The ontological status of the latter is not obvious to me, but obviously I am committed to the existence of the encoding within our brains of a finite Platonic function for unbounded computation.)  Surely a research program formulated to investigate this encoding/access is not perforce incoherent.

I do however deny any implication here that such complex cognition, “in some most mysterious manner, springs only from the organic chemistry, or perhaps the quantum mechanics, of processes that take place in carbon-based biological brains.  [I] have no patience with this parochial, bio-chauvinistic view[:] the key is not the stuff out of which brains are made, but the patterns that can come to exist inside the stuff of a brain” (Hofstadter 1999 [1979]: P-4, P-3).  Thus, as with chess patterns, it is not by necessity that linguistic patterns spring from the stuff of the brain; but the fact remains that they can and do.  And thus linguistics is just as much a biological science as it is a formal science.   

To reiterate, at present there exists no procedure other than human intuition to decide the set of linguistic patterns.  The neurobiology cannot answer the question whether some pattern is linguistic (e.g., whether some sentence is grammatical), but it encodes the procedure that enables the human to intuit the answer to such a question.  Analogously, neurobiological research would not establish the truth of Goldbach’s conjecture or the validity of reasoning by modus ponens, but rather would be unified with research in cognitive science to establish (discover) the rules and representations encoded neurobiologically that enable cognitive conjecture and reasoning.

4.4 Encoding Abstract Objects in Physical Systems

Postal believes that an “explicit brain ontology” as assumed in biolinguistics “has no place for” the encoding of an abstract object such as a Turing machine in a physical system such as the brain—but I see no grounds whatsoever for this belief.  Not only is this belief contradicted by Chomsky’s Turing machine analogy, but Postal himself quotes Chomsky discussing how in biolinguistics “we understand mental states and representations to be physically encoded in some manner” (1983: 156-157); and to physically encode something presumes a non-physical something to be so encoded.  For this reason “it is the mentalistic studies that will ultimately be of greatest value for the investigation of neurophysiological mechanisms, since they alone are concerned with determining abstractly the properties that such mechanisms must exhibit and the functions they must perform” (Chomsky 1965: 193).

It is in this sense of neurobiology encoding mathematical properties and functions that, “astonishingly” (Postal 2012: 23), we observe the obvious fact that “We don’t have sets in our heads.  So you have to know that when we develop a theory about our thinking, about our computation, internal processing and so on in terms of sets, that it’s going to have to be translated into some terms that are neurologically realizable.  [Y]ou talk about a generative grammar as being based on an operation of Merge that forms sets, and so on and so forth.  That’s something metaphorical, and the metaphor has to be spelled out someday” (Chomsky 2012: 91).  In other words, while the formal aspects of a Turing machine (e.g., Merge, sets, etc.) are, ex hypothesi, realized neurologically, it would be absurd (astonishing) to expect physical representation of our arbitrary notations (e.g., fMERGE(X, Y) = {X, Y}).  As Turing observed, in researching the similarities of minds and machines, “we should look [...] for mathematical analogies of function” (1950: 439)—similarities in software, not hardware.

Of course an ontological commitment to abstract properties and functions is not necessarily a commitment to Platonism (as Aristotle demonstrated and many in the biolinguistics program would argue), but it is certainly the default setting.  So it can be argued that I-language is just like Deutsch’s chess program: a multiply realizable computable function (or system of computable functions).  Indeed given that a Turing machine is a mathematical abstraction, I-language qua Turing machine is necessarily and properly defined as a physically (neurobiologically) encoded Platonic object.
           
5 Conclusion

I have argued that mathematical biolinguistics is based on the perfectly coherent concept of computation—as formulated by Turing—unifying mathematical Platonism and biolinguistics: evolution has encoded within the neurobiology of Homo sapiens sapiens a formal system (computable function(s)) generative of an infinite set of linguistic expressions (just as engineers have encoded within the hardware of computers finite functions generative of infinite output).  This thesis, I submit, is or would be accepted by the majority of researchers in biolinguistics, perhaps modulo the Platonism, for indeed it is not necessary to accept the reality of mathematical objects to accept the reality of physical computation.  However, I am a mathematical Platonist, and thus do recognize the reality of mathematical objects, and thus do argue I-language to be a concretization (an “embodiment” in the technical sense) of a mathematical abstraction (a Turing machine), which to my mind best explains the design of language.

References

Boolos, George S. 1971. The iterative conception of set. The Journal of Philosophy 68: 215-231.
Chaitin, Gregory. 2005. Meta Math: The Quest for Omega. New York: Pantheon Books.
Chomsky, Noam. 1965. Aspects of the Theory of Syntax. Cambridge, MA: MIT Press.
Chomsky, Noam. 1983. Some conceptual shifts in the study of language. In How Many
Questions? Essays in Honor          of Sidney Morgenbesser, ed. by Leigh S. Cauman, Isaac Levi, Charles D. Parsons, and Robert Schwartz,   154-169. Indianapolis, IN: Hackett Publishing Company.
Chomsky, Noam. 1986. Knowledge of Language: Its Nature, Origins and Use. New York:
Praeger.
Chomsky, Noam. 2004. The Generative Enterprise Revisited: Discussions with Riny Huybregts,
Henk van Riemsdijk, Naoki Fukui, and Mihoko Zushi. The Hague: Mouton de Gruyter.
Chomsky, Noam. 2005. Three factors in language design. Linguistic Inquiry 36: 1-22.
Chomsky, Noam. 2007. Approaching UG from below. In Interfaces + Recursion = Language?:
Chomsky’s Minimalism and the View from Syntax-Semantics, ed. by Uli Sauerland and Hans-Martin Gartner, 1-29. Berlin: Mouton de Gruyter.
Chomsky, Noam. 2008. On phases. In Foundational Issues in Linguistic Theory: Essays in
         Honor of Jean-Roger         Vergnaud, ed. by Robert Freiden, Carlos P. Otero, and Maria Luisa Zubizarreta, 133-136. Cambridge: MIT             Press.
Chomsky, Noam. 2012. The Science of Language: Interviews with James McGilvray.
Cambridge: Cambridge University Press.
Dennett, Daniel C. 1995. Darwin’s Dangerous Idea: Evolution and the Meanings of Life.
London: Penguin Books.
Deutsch, David. 2011. The Beginning of Infinity. London: Allen Lane.
Enderton, Herbert B. 1977. Elements of recursion theory. In Handbook of Mathematical Logic,
ed. by Jon Barwise, 527-566. Amsterdam: North-Holland.
Gödel, Kurt. 1934 [1965]. On undecidable propositions of formal mathematical systems. In The
Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, ed. by Martin Davis, 39-74. New York: Raven Press.
Gold, Bonnie. 2006. Mathematical objects may be abstract—but they’re NOT acausal! Ms.,
Monmouth University.
Hauser, Marc D., Noam Chomsky, and W. Tecumseh Fitch. 2002. The faculty of language: What
is it, who has it, and how did it evolve? Science 298: 1569-1579.
Hodges, Andrew. 1983. Alan Turing: The Enigma. New York: Simon and Schuster.
Hofstadter, Douglas R. 1999 [1979]. Gödel, Escher, Bach: An Eternal Golden Braid. New York:
Basic Books.
Lenneberg, Eric H. 1967. Biological Foundations of Language. New York: Wiley.
Postal, Paul M. 2004. Skeptical Linguistic Essays. New York: Oxford University Press.
Postal, Paul M. 2009. The incoherence of Chomsky’s ‘biolinguistic’ ontology. Biolinguistics 3:
104-123.
Postal, Paul M. 2012. Chomsky’s foundational admission. http://ling.auf.net/lingbuzz/001569
Quine, Williard van Orman. 1987. Quiddities. Cambridge: Harvard University Press.
Tabor, Whitney. 2009. Dynamical insight into structure in connectionist models. In Toward a
Unified Theory of            Development: Connectionism and Dynamic System Theory Re-Considered, ed. by John P. Spencer, Michael S.C. Thomas, and James L. McClelland, 165-181. Oxford: Oxford University Press.
Turing, Alan M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 42: 230-265.
Turing, Alan M. 1954. Solvable and unsolvable problems. Science News 31: 7-23.
Watumull, Jeffrey. 2012. A Turing program for linguistic theory. Biolinguistics 6.2: 222-245.
Watumull, Jeffrey, Marc D. Hauser, and Robert C. Berwick. 2013. Comparative evolutionary
approaches to      language: On theory and methods. Ms., Massachusetts Institute of Technology.
Weinberg, Steven. 1976. The forces of nature. Bulletin of the American Academy of Arts and
Sciences 29: 13-29.