- recursively
- adverb see recursive
New Collegiate Dictionary. 2001.
recursively
Look at other dictionaries:
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … 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
recursively pack subdirectories — pakuoti su pakatalogiais statusas T sritis informatika apibrėžtis ↑Pakuoklės nuostata, nurodanti, kad turi būti pakuojami ne tik failai, tiesiogiai įeinantys į nurodytą katalogą, bet ir visi kiti, esantys to katalogo visų lygių pakatalogiuose.… … Enciklopedinis kompiuterijos žodynas
recursively — adverb a) In a recursive way or manner. b) Using recursion … Wiktionary
recursively — rɪ kÉœrsɪvlɪ / kÉœËs adv. in a repetitive manner, in a manner that repeats itself … English contemporary dictionary
recursively — adverb see recursive … Useful english dictionary
recursively enumerable — adjective Of a set, such that there exists a deterministic algorithm which will list all the items in the set and no others … Wiktionary
co-recursively enumerable — adjective Describing a set for which there exists a deterministic algorithm that will list all items not in that set. Any recursively enumerable set which is also co recursively enumerable is a decidable set … Wiktionary
recursive — recursively, adv. recursiveness, n. /ri kerr siv/, adj. 1. pertaining to or using a rule or procedure that can be applied repeatedly. 2. Math., Computers. pertaining to or using the mathematical process of recursion: a recursive function; a… … Universalium
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
