-
1 recursive language
Англо-русский словарь промышленной и научной лексики > recursive language
-
2 Programming Language
1) Theories of Human Mental Processes Can Be Expressed in Programming LanguagesIt [the information-processing revolution] has introduced computer programming languages as formal ["mathematical"] languages for expressing theories of human mental processes; and it has introduced the computers themselves as a device to simulate these processes and thereby make behavioral predictions for testing of the theories. (Simon, 1979, p. ix)LISP is now the second oldest programming language in present widespread use (after FORTRAN).... Its core occupies some kind of local optimum in the space of programming languages given that static friction discourages purely notational changes. Recursive use of conditional expressions, representation of symbolic information externally by lists and internally by list structure, and representation of program in the same way will probably have a very long life. (McCarthy, quoted in Barr & Feigenbaum, 1982, p. 5)Although it sounds implausible, it might turn out that above a certain level of complexity, a machine ceased to be predictable, even in principle, and started doing things on its own account, or, to use a very revealing phrase, it might begin to have a mind of its own. (Lucas, quoted in Hand, 1985, p. 4)Historical dictionary of quotations in cognitive science > Programming Language
-
3 rekurzivni jezik
• recursive language -
4 rekurzivni jezik
• recursive language -
5 рекурсивный язык
Information technology: recursive language -
6 Logic
My initial step... was to attempt to reduce the concept of ordering in a sequence to that of logical consequence, so as to proceed from there to the concept of number. To prevent anything intuitive from penetrating here unnoticed, I had to bend every effort to keep the chain of inference free of gaps. In attempting to comply with this requirement in the strictest possible way, I found the inadequacy of language to be an obstacle. (Frege, 1972, p. 104)I believe I can make the relation of my 'conceptual notation' to ordinary language clearest if I compare it to the relation of the microscope to the eye. The latter, because of the range of its applicability and because of the ease with which it can adapt itself to the most varied circumstances, has a great superiority over the microscope. Of course, viewed as an optical instrument it reveals many imperfections, which usually remain unnoticed only because of its intimate connection with mental life. But as soon as scientific purposes place strong requirements upon sharpness of resolution, the eye proves to be inadequate.... Similarly, this 'conceptual notation' is devised for particular scientific purposes; and therefore one may not condemn it because it is useless for other purposes. (Frege, 1972, pp. 104-105)To sum up briefly, it is the business of the logician to conduct an unceasing struggle against psychology and those parts of language and grammar which fail to give untrammeled expression to what is logical. He does not have to answer the question: How does thinking normally take place in human beings? What course does it naturally follow in the human mind? What is natural to one person may well be unnatural to another. (Frege, 1979, pp. 6-7)We are very dependent on external aids in our thinking, and there is no doubt that the language of everyday life-so far, at least, as a certain area of discourse is concerned-had first to be replaced by a more sophisticated instrument, before certain distinctions could be noticed. But so far the academic world has, for the most part, disdained to master this instrument. (Frege, 1979, pp. 6-7)There is no reproach the logician need fear less than the reproach that his way of formulating things is unnatural.... If we were to heed those who object that logic is unnatural, we would run the risk of becoming embroiled in interminable disputes about what is natural, disputes which are quite incapable of being resolved within the province of logic. (Frege, 1979, p. 128)[L]inguists will be forced, internally as it were, to come to grips with the results of modern logic. Indeed, this is apparently already happening to some extent. By "logic" is not meant here recursive function-theory, California model-theory, constructive proof-theory, or even axiomatic settheory. Such areas may or may not be useful for linguistics. Rather under "logic" are included our good old friends, the homely locutions "and," "or," "if-then," "if and only if," "not," "for all x," "for some x," and "is identical with," plus the calculus of individuals, event-logic, syntax, denotational semantics, and... various parts of pragmatics.... It is to these that the linguist can most profitably turn for help. These are his tools. And they are "clean tools," to borrow a phrase of the late J. L. Austin in another context, in fact, the only really clean ones we have, so that we might as well use them as much as we can. But they constitute only what may be called "baby logic." Baby logic is to the linguist what "baby mathematics" (in the phrase of Murray Gell-Mann) is to the theoretical physicist-very elementary but indispensable domains of theory in both cases. (Martin, 1969, pp. 261-262)There appears to be no branch of deductive inference that requires us to assume the existence of a mental logic in order to do justice to the psychological phenomena. To be logical, an individual requires, not formal rules of inference, but a tacit knowledge of the fundamental semantic principle governing any inference; a deduction is valid provided that there is no way of interpreting the premises correctly that is inconsistent with the conclusion. Logic provides a systematic method for searching for such counter-examples. The empirical evidence suggests that ordinary individuals possess no such methods. (Johnson-Laird, quoted in Mehler, Walker & Garrett, 1982, p. 130)The fundamental paradox of logic [that "there is no class (as a totality) of those classes which, each taken as a totality, do not belong to themselves" (Russell to Frege, 16 June 1902, in van Heijenoort, 1967, p. 125)] is with us still, bequeathed by Russell-by way of philosophy, mathematics, and even computer science-to the whole of twentieth-century thought. Twentieth-century philosophy would begin not with a foundation for logic, as Russell had hoped in 1900, but with the discovery in 1901 that no such foundation can be laid. (Everdell, 1997, p. 184)Historical dictionary of quotations in cognitive science > Logic
См. также в других словарях:
Recursive language — This article is about a class of formal languages as they are studied in mathematics and theoretical computer science. For computer languages that allow a function to call itself recursively, see Recursion (computer science). In mathematics,… … Wikipedia
Recursive — may refer to:*Recursion *Recursively enumerable language *Recursively enumerable set *Recursive filter *Recursive function *Recursive language *Recursive acronym *Recursive set *Primitive recursive function … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Language identification in the limit — is a formal model for inductive inference. It was introduced by E. Mark Gold in his paper with the same title [http://www.isrl.uiuc.edu/ amag/langev/paper/gold67limit.html] . In this model, a learner is provided with presentation of some language … Wikipedia
Recursive function — may refer to: Recursion (computer science), a procedure or subroutine, implemented in a programming language, whose implementation references itself A total computable function, a function which is defined for all possible inputs See also μ… … Wikipedia
Recursive acronym — A recursive acronym (synonymous with metacronym,[1] recursive initialism, and recursive backronym) is an acronym or initialism that refers to itself in the expression for which it stands. The term was first used in print in April 1986.[2]… … Wikipedia
Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… … Wikipedia
Recursive type — In computer programming languages, a recursive type is a data type for values that may contain other values of the same type.An example is the list type, in Haskell: data List a = Nil | Cons a (List a) This indicates that a list of a s is either… … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
Recursively enumerable language — In mathematics, logic and computer science, a recursively enumerable language is a type of formal language which is also called partially decidable or Turing acceptable. It is known as a type 0 language in the Chomsky hierarchy of formal… … Wikipedia
