almost recursive

almost recursive
мат. почти рекурсивный

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем решить контрольную работу

Смотреть что такое "almost recursive" в других словарях:

  • recursive acronym — n. An acronym that refers to itself, usually by incorporating the acronym as the first word in the expanded phrase. Example Citation: Dear Sir, Since I see a side bar on recursive acronyms (October EXE p. 34), it occurs to me that your readers… …   New words

  • Acronymie Récursive — onymie Acronymie   Rétro acronymie   Acronymie récursive Antonymie Autonymie Éponymie Holonymie …   Wikipédia en Français

  • Acronymie recursive — Acronymie récursive onymie Acronymie   Rétro acronymie   Acronymie récursive Antonymie Autonymie Éponymie Holonymie …   Wikipédia en Français

  • Acronymie récursive — L acronymie récursive est une forme d acronymie qui fait appel à la récursivité et plus précisément à l auto référence dans un procédé de mise en abyme littéraire. On parle aussi d autonymie. On trouve des acronymes récursifs essentiellement en… …   Wikipédia en Français

  • metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …   Universalium

  • History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

  • C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»