Find link

language:

Find link is a tool written by Edward Betts.

searching for Recursion (computer science) 336 found (692 total)

alternate case: recursion (computer science)

Iteration (772 words) [view diff] no match in snippet view article find links to article

the next iteration. In mathematics and computer science, iteration (along with the related technique of recursion) is a standard element of algorithms.

Stephen Cole Kleene (1,674 words) [view diff] no match in snippet view article find links to article

mathematical logic known as recursion theory, which subsequently helped to provide the foundations of theoretical computer science. Kleene's work grounds the

This (computer programming) (3,116 words) [view diff] no match in snippet view article

recursion, and means that these methods can be overridden by derived classes or objects. By contrast, direct named recursion or anonymous recursion of

Structural induction (1,750 words) [view diff] no match in snippet view article find links to article

induction. Structural recursion is a recursion method bearing the same relationship to structural induction as ordinary recursion bears to ordinary mathematical

Hennessy–Milner logic (647 words) [view diff] no match in snippet view article find links to article

use of recursion to extend the expressibility of the logic, and is commonly referred to as 'Hennessy-Milner Logic with recursion'. Recursion is enabled

Top-down parsing (1,368 words) [view diff] no match in snippet view article find links to article

Top-down parsing in computer science is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by

Mathematical logic (8,370 words) [view diff] no match in snippet view article find links to article

problem, a result with far-ranging implications in both recursion theory and computer science. There are many known examples of undecidable problems from

Quine (computing) (2,737 words) [view diff] no match in snippet view article

standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs"

Apomorphism (123 words) [view diff] no match in snippet view article find links to article

of anamorphism (coinduction). Whereas a paramorphism models primitive recursion over an inductive data type, an apomorphism models primitive corecursion

Process calculus (2,449 words) [view diff] no match in snippet view article find links to article

In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process

Recursive descent parser (1,157 words) [view diff] no match in snippet view article find links to article

left recursion. Any context-free grammar can be transformed into an equivalent grammar that has no left recursion, but removal of left recursion does

Turing degree (3,130 words) [view diff] no match in snippet view article find links to article

In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures

Church–Turing thesis (6,846 words) [view diff] no match in snippet view article find links to article

functions (with arbitrarily many arguments) that is closed under composition, recursion, and minimization, and includes zero, successor, and all projections.

Theory of computation (2,168 words) [view diff] no match in snippet view article find links to article

In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation

Lambda calculus (9,260 words) [view diff] no match in snippet view article find links to article

calculus may be used to model arithmetic, Booleans, data structures, and recursion, as illustrated in the following sub-sections i, ii, iii, and § iv. There

Tree (abstract data type) (2,207 words) [view diff] no match in snippet view article

In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node

Algorithmic technique (913 words) [view diff] no match in snippet view article find links to article

In mathematics and computer science, an algorithmic technique is a general approach for implementing a process or computation. There are several broadly

William Gasarch (715 words) [view diff] no match in snippet view article find links to article

received his doctorate in computer science from Harvard in 1985, advised by Harry R. Lewis. His thesis was titled Recursion-Theoretic Techniques in Complexity

Dimiter Skordev (226 words) [view diff] no match in snippet view article find links to article

of Mathematical Logic and Applications, Faculty of Mathematics and Computer Science at the University of Sofia. Chairman of the department in 1972-2000

Paramorphism (305 words) [view diff] no match in snippet view article find links to article

In formal methods of computer science, a paramorphism (from Greek παρά, meaning "close together") is an extension of the concept of catamorphism first

Inductive type (1,464 words) [view diff] no match in snippet view article find links to article

be self-referential, but usually only in a way that permits structural recursion. The standard example is encoding the natural numbers using Peano's encoding

List of mathematical logic topics (1,014 words) [view diff] no match in snippet view article find links to article

problem Undecidable problem Institutional model theory Institution (computer science) Non-standard analysis Non-standard calculus Hyperinteger Hyperreal

Total functional programming (719 words) [view diff] no match in snippet view article find links to article

restricted form of recursion, which operates only upon 'reduced' forms of its arguments, such as Walther recursion, substructural recursion, or "strongly normalizing"

Hypercomputation (3,372 words) [view diff] no match in snippet view article find links to article

the correct answer.)" L. K. Schubert's 1974 paper "Iterated Limiting Recursion and the Program Minimization Problem" studied the effects of iterating

Merge sort (6,747 words) [view diff] no match in snippet view article find links to article

In computer science, merge sort (also commonly spelled as mergesort and as merge-sort) is an efficient, general-purpose, and comparison-based sorting algorithm

Radix sort (2,593 words) [view diff] no match in snippet view article find links to article

In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according

Initial algebra (1,139 words) [view diff] no match in snippet view article find links to article

endofunctor F. This initiality provides a general framework for induction and recursion. Consider the endofunctor 1 + (−), i.e. F : Set → Set sending X to 1 +

Caml (858 words) [view diff] no match in snippet view article find links to article

Caml was developed in France at French Institute for Research in Computer Science and Automation (INRIA) and École normale supérieure (Paris) (ENS).

Live coding (1,531 words) [view diff] no match in snippet view article find links to article

and recursion solutions, but timing had been a major issue. While the general form of a temporal recursion, being any asynchronous function recursion through

Martin Hyland (284 words) [view diff] no match in snippet view article find links to article

on category theory applied to logic (proof theory, recursion theory), theoretical computer science (lambda-calculus and semantics) and higher-dimensional

Simply typed lambda calculus (4,565 words) [view diff] no match in snippet view article find links to article

such as products, coproducts or natural numbers (System T) or even full recursion (like PCF). In contrast, systems that introduce polymorphic types (like

Typed lambda calculus (743 words) [view diff] no match in snippet view article find links to article

In mathematics and computer science, a typed lambda calculus is a typed formalism that uses the lambda symbol ( λ {\displaystyle \lambda } ) to denote

John V. Tucker (1,601 words) [view diff] no match in snippet view article find links to article

computer scientist and expert on computability theory, also known as recursion theory. Computability theory is about what can and cannot be computed

LL parser (4,494 words) [view diff] no match in snippet view article find links to article

In computer science, an LL parser (left-to-right, leftmost derivation) is a top-down parser for a restricted context-free language. It parses the input

Proof theory (2,669 words) [view diff] no match in snippet view article find links to article

Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating

Memory-bound function (1,165 words) [view diff] no match in snippet view article find links to article

In computer science, a computational problem is memory-bound when the time it takes for it to complete is decided primarily by the amount of free memory

Matching wildcards (1,545 words) [view diff] no match in snippet view article find links to article

In computer science, an algorithm for matching wildcards (also known as globbing) is useful in comparing text strings that may contain wildcard syntax

Rohit Jivanlal Parikh (1,092 words) [view diff] no match in snippet view article find links to article

philosopher who has worked in many areas in traditional logic, including recursion theory and proof theory. He is a Distinguished Professor at Brooklyn College

Induction-recursion (1,125 words) [view diff] no match in snippet view article find links to article

type theory (ITT), a discipline within mathematical logic, induction-recursion is a feature for simultaneously declaring a type and function on that

Emil Leon Post (1,397 words) [view diff] no match in snippet view article find links to article

Functional completeness List of multiple discoveries List of pioneers in computer science Urquhart (2008) O'Connor, John J.; Robertson, Edmund F., "Emil Leon

Parsing expression grammar (6,497 words) [view diff] no match in snippet view article find links to article

In computer science, a parsing expression grammar (PEG) is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of

Rózsa Péter (1,071 words) [view diff] no match in snippet view article find links to article

mathematician and logician. She is best known as the "founding mother of recursion theory". Péter was born in Budapest, Hungary, as Rózsa Politzer (Hungarian:

Walls and Mirrors (650 words) [view diff] no match in snippet view article find links to article

Walls And Mirrors is a computer science textbook, for undergraduates taking a second computer science course (typically on the subject of data structures

Code as data (728 words) [view diff] no match in snippet view article find links to article

In computer science, the expression code as data refers to the idea that source code written in a programming language can be manipulated as data, such

Prolog (8,136 words) [view diff] no match in snippet view article find links to article

call optimization (TCO) for deterministic predicates exhibiting tail recursion or, more generally, tail calls: A clause's stack frame is discarded before

Logic in computer science (1,837 words) [view diff] no match in snippet view article find links to article

role in computer science. Some of the key areas of logic that are particularly significant are computability theory (formerly called recursion theory)

Systems of Logic Based on Ordinals (465 words) [view diff] no match in snippet view article find links to article

original theory, and even goes one step further in using transfinite recursion to go "past infinity", yielding a set of new theories Gα, one for each

Recamán's sequence (633 words) [view diff] no match in snippet view article find links to article

previous elements in a straightforward way, they are often defined using recursion. It takes its name after its inventor Bernardo Recamán Santos [es], a

Prolog (8,136 words) [view diff] no match in snippet view article find links to article

call optimization (TCO) for deterministic predicates exhibiting tail recursion or, more generally, tail calls: A clause's stack frame is discarded before

Hybrid algorithm (628 words) [view diff] no match in snippet view article find links to article

moves deeper in the recursion. In this case, one algorithm is used for the overall approach (on large data), but deep in the recursion, it switches to a

Cybernetics (4,396 words) [view diff] no match in snippet view article find links to article

transdisciplinary study of circular causal processes such as feedback and recursion, where the effects of a system's actions (its outputs) return as inputs

Undecidable problem (1,924 words) [view diff] no match in snippet view article find links to article

between these two is that if a decision problem is undecidable (in the recursion theoretical sense) then there is no consistent, effective formal system

List of formal systems (272 words) [view diff] no match in snippet view article find links to article

problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic

Hierarchical and recursive queries in SQL (1,377 words) [view diff] no match in snippet view article find links to article

2.1), Microsoft SQL Server (starting with version 2005), Oracle (with recursion since 11g release 2), PostgreSQL (since 8.4), MariaDB (since 10.2), MySQL

Head-driven phrase structure grammar (1,227 words) [view diff] no match in snippet view article find links to article

generalized phrase structure grammar. HPSG draws from other fields such as computer science (data type theory and knowledge representation) and uses Ferdinand

List of terms relating to algorithms and data structures (3,135 words) [view diff] no match in snippet view article find links to article

recurrence equations recurrence relation recursion recursion termination recursion tree recursive (computer science) recursive data structure recursive doubling

Computability (3,293 words) [view diff] no match in snippet view article find links to article

theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence

List (abstract data type) (1,409 words) [view diff] no match in snippet view article

In computer science, a list or sequence is a collection of items that are finite in number and in a particular order. An instance of a list is a computer

Linda (coordination language) (1,664 words) [view diff] no match in snippet view article

In computer science, Linda is a coordination model that aids communication in parallel computing environments. Developed by David Gelernter, it is meant

Regular numerical predicate (2,184 words) [view diff] no match in snippet view article find links to article

In computer science and mathematics, more precisely in automata theory, model theory and formal language, a regular numerical predicate is a kind of relation

Bottom type (996 words) [view diff] no match in snippet view article find links to article

typically correspond to error conditions such as undefined behavior, infinite recursion, or unrecoverable errors. In Bounded Quantification with Bottom, Pierce

Parser combinator (1,678 words) [view diff] no match in snippet view article find links to article

language Haskell that solve the long-standing problem of accommodating left recursion, and work as a complete top-down parsing tool in polynomial time and space

Enumeration (1,633 words) [view diff] no match in snippet view article find links to article

items in a collection. The term is commonly used in mathematics and computer science to refer to a listing of all of the elements of a set. The precise

Bron–Kerbosch algorithm (2,134 words) [view diff] no match in snippet view article find links to article

In computer science, the Bron–Kerbosch algorithm is an enumeration algorithm for finding all maximal cliques in an undirected graph. That is, it lists

Session type (899 words) [view diff] no match in snippet view article find links to article

branches ( & {\displaystyle \&} ), selections ( ⊕ {\displaystyle \oplus } ), recursion ( r e c {\displaystyle rec} ) and termination ( e n d {\displaystyle end}

Jill Zimmerman (747 words) [view diff] no match in snippet view article find links to article

Fellow. In 1990, she earned a doctorate in computer science, specializing in computational and recursion theory. Zimmerman completed her dissertation

Session type (899 words) [view diff] no match in snippet view article find links to article

branches ( & {\displaystyle \&} ), selections ( ⊕ {\displaystyle \oplus } ), recursion ( r e c {\displaystyle rec} ) and termination ( e n d {\displaystyle end}

Tail recursive parser (385 words) [view diff] no match in snippet view article find links to article

In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to

Recursive acronym (1,777 words) [view diff] no match in snippet view article find links to article

Ellis Horowitz; Sartaj Sahni (1976). Fundamentals Of Data Structures. Computer Science Press. ISBN 978-0-914894-20-9 – via Google Books. Stenberg, Daniel

Mogensen–Scott encoding (2,490 words) [view diff] no match in snippet view article find links to article

In computer science, Scott encoding is a way to represent algebraic data types in the lambda calculus, following their syntactic definition without regard

Ann Copestake (508 words) [view diff] no match in snippet view article find links to article

professor of computational linguistics and head of the Department of Computer Science and Technology at the University of Cambridge and a fellow of Wolfson

History of the Church–Turing thesis (8,298 words) [view diff] no match in snippet view article find links to article

computable. It is an important topic in modern mathematical theory and computer science, particularly associated with the work of Alonzo Church and Alan Turing

Chicken or the egg (1,175 words) [view diff] no match in snippet view article find links to article

Bootstrapping (compilers), the solution to an analogous problem in computer science Catch-22 Sorites paradox "Essays and Miscellanies, by Plutarch". Project

Yoshua Bengio (2,813 words) [view diff] no match in snippet view article find links to article

Bachelor of Science degree (electrical engineering), MSc (computer science) and PhD (computer science) from McGill University. Bengio is the brother of Samy

Symposium on Logic in Computer Science (670 words) [view diff] no match in snippet view article find links to article

Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation to mathematical

Reverse mathematics (4,794 words) [view diff] no match in snippet view article find links to article

The use of second-order arithmetic also allows many techniques from recursion theory to be employed; many results in reverse mathematics have corresponding

Scott information system (700 words) [view diff] no match in snippet view article find links to article

In domain theory, a branch of mathematics and computer science, a Scott information system is a primitive kind of logical deductive system often used as

Bogosort (1,904 words) [view diff] no match in snippet view article find links to article

In computer science, bogosort (also known as permutation sort and stupid sort) is a sorting algorithm based on the generate and test paradigm. The function

Alphabet (formal languages) (909 words) [view diff] no match in snippet view article

is used in a diverse range of fields including logic, mathematics, computer science, and linguistics. An alphabet may have any cardinality ("size") and

Decision problem (1,246 words) [view diff] no match in snippet view article find links to article

efficient algorithm for a certain problem. On the other hand, the field of recursion theory categorizes undecidable decision problems by Turing degree, which

Cilk (3,528 words) [view diff] no match in snippet view article find links to article

language grew out of three separate projects at the MIT Laboratory for Computer Science: Theoretical work on scheduling multi-threaded applications. StarTech

Π-calculus (4,864 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along the

Statement (computer science) (1,886 words) [view diff] no match in snippet view article

metalanguage. Pascal used both syntax diagrams and equivalent BNF. BNF uses recursion to express repetition, so various extensions have been proposed to allow

Run-time algorithm specialization (1,072 words) [view diff] no match in snippet view article find links to article

In computer science, run-time algorithm specialization is a methodology for creating efficient algorithms for costly computation tasks of certain kinds

Super-recursive algorithm (445 words) [view diff] no match in snippet view article find links to article

are obtained by super-recursive algorithms. The Church–Turing thesis in recursion theory relies on a particular definition of the term algorithm. Based

The Complexity of Songs (863 words) [view diff] no match in snippet view article find links to article

TELNET Song used a completely different algorithm based on exponential recursion, a parody on some implementations of TELNET. Darrah Chavey suggested that

Jayadev Misra (1,066 words) [view diff] no match in snippet view article find links to article

United States. He is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at the University

Recursively enumerable language (538 words) [view diff] no match in snippet view article find links to article

In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable,

List of pioneers in computer science (1,788 words) [view diff] no match in snippet view article find links to article

computer science awards List of computer science journals List of computer scientists List of Internet pioneers List of pioneers in computer science List

Decidability (logic) (1,887 words) [view diff] no match in snippet view article

Decidable". Conference on Computability in Europe. Lecture Notes in Computer Science. Vol. 7318. Springer. pp. 78–88. arXiv:1201.5597. doi:10.1007/978-3-642-30870-3_9

List of pioneers in computer science (1,788 words) [view diff] no match in snippet view article find links to article

computer science awards List of computer science journals List of computer scientists List of Internet pioneers List of pioneers in computer science List

Glossary of computer science (23,985 words) [view diff] no match in snippet view article find links to article

This glossary of computer science is a list of definitions of terms and concepts used in computer science, its sub-disciplines, and related fields, including

The Art of Computer Programming (2,975 words) [view diff] no match in snippet view article find links to article

subvolumes) Chapter 7 – Combinatorial searching (continued) Chapter 8 – Recursion Volume 5 – Syntactic algorithms Chapter 9 – Lexical scanning (also includes

Oracle machine (2,052 words) [view diff] no match in snippet view article find links to article

Robert I. (1987). "Fundamentals of Recursively Enumerable Sets and the Recursion Theorem". Recursively Enumerable Sets and Degrees. Perspectives in Mathematical

Computable function (3,362 words) [view diff] no match in snippet view article find links to article

and projection functions, and is closed under composition, primitive recursion, and the μ operator. Equivalently, computable functions can be formalized

Online machine learning (4,834 words) [view diff] no match in snippet view article find links to article

In computer science, online machine learning is a method of machine learning in which data becomes available in a sequential order and is used to update

Giuseppe Longo (2,483 words) [view diff] no match in snippet view article find links to article

connections between concepts utilized in computer science and mathematical structures derived from generalized recursion, demonstration theory, and category

Reduction (complexity) (1,661 words) [view diff] no match in snippet view article

undecidable. Fine-grained reduction Gadget (computer science) Many-one reduction Parsimonious reduction Reduction (recursion theory) Truth table reduction Turing

Simon Thompson (professor) (634 words) [view diff] no match in snippet view article

Phil.) from the University of Oxford in 1984 with a dissertation titled "Recursion theories on the continuous functionals". Thompson's doctoral adviser was

Algorithm characterizations (8,991 words) [view diff] no match in snippet view article find links to article

called just "recursion"; however, "primitive recursion"—calculation by use of the five recursive operators—is a lesser form of recursion that lacks access

Outline of academic disciplines (5,674 words) [view diff] no match in snippet view article find links to article

theory Recursion theory Modal logic Intuitionistic logic Philosophical logic Logical reasoning Modal logic Deontic logic Doxastic logic Logic in computer science

Nonogram (4,589 words) [view diff] no match in snippet view article find links to article

the next step of the solution even without contradictions and deeper recursion. However, finding such sets is usually as difficult as finding contradictions

Introselect (524 words) [view diff] no match in snippet view article find links to article

In computer science, introselect (short for "introspective selection") is a selection algorithm that is a hybrid of quickselect and median of medians which

Rod Downey (1,320 words) [view diff] no match in snippet view article find links to article

investigations that have made him a leading expert in many aspects of recursion theory, effective algebra and complexity". In 1994, he won the New Zealand

Chong Chi Tat (386 words) [view diff] no match in snippet view article find links to article

University of Singapore (NUS). His research interests are in the areas of recursion/computability theory. Chong received his BSc with distinction from Iowa

Lock (computer science) (3,538 words) [view diff] no match in snippet view article

In computer science, a lock or mutex (from mutual exclusion) is a synchronization primitive that prevents state from being modified or accessed by multiple

László Kalmár (751 words) [view diff] no match in snippet view article find links to article

Kalmár is considered the founder of mathematical logic and theoretical computer science in Hungary. Kalmár was of Jewish ancestry. His early life mixed promise

Multigrid method (2,837 words) [view diff] no match in snippet view article find links to article

coded using recursion. Since the function calls itself with smaller sized (coarser) parameters, the coarsest grid is where the recursion stops. In cases

List of theorems (6,306 words) [view diff] no match in snippet view article find links to article

(computer science) (theoretical computer science) Reversed compound agent theorem (probability) Rice's theorem (recursion theory, computer science) Rice–Shapiro

Arity (1,464 words) [view diff] no match in snippet view article find links to article

In logic, mathematics, and computer science, arity (/ˈærɪti/ ) is the number of arguments or operands taken by a function, operation or relation. In mathematics

Overlapping subproblems (309 words) [view diff] no match in snippet view article find links to article

In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times

Formal language (3,163 words) [view diff] no match in snippet view article find links to article

In logic, mathematics, computer science, and linguistics, a formal language is a set of strings whose symbols are taken from a set called "alphabet". The

Semaphore (programming) (3,010 words) [view diff] no match in snippet view article

In computer science, a semaphore is a variable or abstract data type used to control access to a common resource by multiple threads and avoid critical

Viggo Stoltenberg-Hansen (197 words) [view diff] no match in snippet view article find links to article

is a Swedish mathematician/logician and expert on domain theory and recursion theory (also known as computability theory). Viggo received his PhD in

Jose Meseguer (1,001 words) [view diff] no match in snippet view article find links to article

obtained his PhD in mathematics in 1975 with a thesis titled Primitive recursion in model categories under Michael Pfender at the University of Zaragoza

Syntax (logic) (1,048 words) [view diff] no match in snippet view article

language that constitute the well-formed formulas of a formal system. In computer science, the term syntax refers to the rules governing the composition of well-formed

Mu (letter) (1,711 words) [view diff] no match in snippet view article

measure in measure theory minimalization in computability theory and Recursion theory the integrating factor in ordinary differential equations the degree

List of computer scientists (5,250 words) [view diff] no match in snippet view article find links to article

This is a list of computer scientists, people who do work in computer science, in particular researchers and authors. Some persons notable as programmers

Turing machine (9,353 words) [view diff] no match in snippet view article find links to article

abstract properties of Turing machines has yielded many insights into computer science, computability theory, and complexity theory. In his 1948 essay, "Intelligent

Sean M. Burke (454 words) [view diff] no match in snippet view article find links to article

of Best of The Perl Journal. Dominus, Mark Jason (2005). "Chapter 1: Recursion and Callbacks". Higher-Order Perl: Transforming Programs with Programs

Index of object-oriented programming articles (438 words) [view diff] no match in snippet view article find links to article

programming. Abstract class Accessibility Abstract method Abstraction (computer science) Access control Access modifiers Accessor method Adapter pattern Aspect-oriented

Explicit substitution (713 words) [view diff] no match in snippet view article find links to article

Programming and Reasoning with Guarded Recursion for Coinductive Types". Logical Methods in Computer Science. 12 (3): 36. arXiv:1606.09455. doi:10

Combinatory logic (5,316 words) [view diff] no match in snippet view article find links to article

Schönfinkel and Haskell Curry, and has more recently been used in computer science as a theoretical model of computation and also as a basis for the design

Chaitin's constant (2,319 words) [view diff] no match in snippet view article find links to article

In the computer science subfield of algorithmic information theory, a Chaitin constant (Chaitin omega number) or halting probability is a real number that

R. Martin Chavez (1,106 words) [view diff] no match in snippet view article find links to article

He is chairman of the board of computational pharmaceutical company Recursion, Board Observer of biotech company Earli and longevity biopharma company

Coroutine (5,579 words) [view diff] no match in snippet view article find links to article

coroutines for state machines or concurrency is similar to using mutual recursion with tail calls, as in both cases the control changes to a different one

Institutional model theory (361 words) [view diff] no match in snippet view article find links to article

Joseph A. Goguen on the Occasion of His 65th Birthday. Lecture Notes in Computer Science 4060, p. 65-98, Springer-Verlag, 2006. Marius Petria and Rãzvan Diaconescu:

Benchmark (computing) (2,675 words) [view diff] no match in snippet view article

POV-Ray – 3D render Tak (function) – a simple benchmark used to test recursion performance TATP Benchmark – Telecommunication Application Transaction

Categorical abstract machine (349 words) [view diff] no match in snippet view article find links to article

categorical abstract machine arose in the mid-1980s. It took its place in computer science as a kind of theory of computation for programmers, represented by

Warnier/Orr diagram (1,491 words) [view diff] no match in snippet view article find links to article

more advanced concepts that are occasionally needed: concurrency and recursion. Hierarchy is the most fundamental of all of the Warnier/Orr constructs

Bekić's theorem (1,250 words) [view diff] no match in snippet view article find links to article

a theorem about fixed-points which allows splitting a mutual recursion into recursions on one variable at a time. It was created by Austrian Hans Bekić

Hirschberg's algorithm (1,326 words) [view diff] no match in snippet view article find links to article

In computer science, Hirschberg's algorithm, named after its inventor, Dan Hirschberg, is a dynamic programming algorithm that finds the optimal sequence

Entscheidungsproblem (2,642 words) [view diff] no match in snippet view article find links to article

In mathematics and computer science, the Entscheidungsproblem (German for 'decision problem'; pronounced [ɛntˈʃaɪ̯dʊŋspʁoˌbleːm]) is a challenge posed

Empirical algorithmics (1,220 words) [view diff] no match in snippet view article find links to article

In computer science, empirical algorithmics (or experimental algorithmics) is the practice of using empirical methods to study the behavior of algorithms

Criticism of Java (3,623 words) [view diff] no match in snippet view article find links to article

pointers and recursion as the two gatekeeper concepts? Because he found them difficult? As Tim Bray points out, Java is perfectly adept at recursion, and concurrency

Donald Knuth (6,290 words) [view diff] no match in snippet view article find links to article

of the ACM Turing Award, informally considered the Nobel Prize of computer science. Knuth has been called the "father of the analysis of algorithms".

High-level programming language (1,605 words) [view diff] no match in snippet view article find links to article

and Boolean expressions, functions, loops, threads, locks, and other computer science abstractions, intended to facilitate correctness and maintainability

Counting sort (1,591 words) [view diff] no match in snippet view article find links to article

In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small positive integers; that is, it

In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines, analogous to a Turing machine and thus

Denotational semantics (3,767 words) [view diff] no match in snippet view article find links to article

In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the meanings

Richard Waldinger (869 words) [view diff] no match in snippet view article find links to article

Richard Jay Waldinger is a computer science researcher at SRI International's Artificial Intelligence Center (where he has worked since 1969) whose interests

Parsing (4,882 words) [view diff] no match in snippet view article find links to article

slightly different meanings in different branches of linguistics and computer science. Traditional sentence parsing is often performed as a method of understanding

Patrick C. Fischer (1,074 words) [view diff] no match in snippet view article find links to article

the supervision of Hartley Rogers, Jr., with a thesis on the subject of recursion theory. After receiving his Ph.D. in 1962, Fischer joined the faculty

L-system (4,687 words) [view diff] no match in snippet view article find links to article

above to the earlier recursion, one gets: Axiom First recursion Second recursion Third recursion Fourth recursion Seventh recursion, scaled down ten times

Matrix analytic method (912 words) [view diff] no match in snippet view article find links to article

109.2225. doi:10.1145/511399.511346. Ramaswami, V. (1988). "A stable recursion for the steady state vector in markov chains of m/g/1 type". Communications

Parametric polymorphism (2,466 words) [view diff] no match in snippet view article find links to article

Subtype polymorphism and Generic programming). Parametricity Polymorphic recursion Type class#Higher-kinded polymorphism Trait (computer programming) Benjamin

Halting problem (7,369 words) [view diff] no match in snippet view article find links to article

for electrical engineers and technical specialists. Discusses recursion, partial-recursion with reference to Turing Machines, halting problem. Has a Turing

Smallest-circle problem (2,602 words) [view diff] no match in snippet view article find links to article

of points known to be on the boundary as an additional parameter. The recursion terminates when P is empty, and a solution can be found from the points

Computational epistemology (1,321 words) [view diff] no match in snippet view article find links to article

bounded agents. In short, computational epistemology is to induction what recursion theory is to deduction. It has been applied to problems in philosophy

Cooley–Tukey FFT algorithm (5,350 words) [view diff] no match in snippet view article find links to article

implementations the depth-first recursion is eliminated in favor of a nonrecursive breadth-first approach, although depth-first recursion has been argued to have

First-class function (2,522 words) [view diff] no match in snippet view article find links to article

In computer science, a programming language is said to have first-class functions if it treats functions as first-class citizens. This means the language

Fixed point (mathematics) (1,696 words) [view diff] no match in snippet view article

postfixpoint. Prefixpoints and postfixpoints have applications in theoretical computer science. In order theory, the least fixed point of a function from a partially

Peter Buneman (1,067 words) [view diff] no match in snippet view article find links to article

briefly at the University of Edinburgh, followed by a professorship of computer science at the University of Pennsylvania, which he held for several decades

Zero-based numbering (2,976 words) [view diff] no match in snippet view article find links to article

programming and hardware design. In computer science, zero is thus often used as the base case for many kinds of numerical recursion. Proofs and other sorts of

Karger's algorithm (2,303 words) [view diff] no match in snippet view article find links to article

In computer science and graph theory, Karger's algorithm is a randomized algorithm to compute a minimum cut of a connected graph. It was invented by David

Monadic second-order logic (1,308 words) [view diff] no match in snippet view article find links to article

Structures Are Computable with Linear Delay". Computer Science Logic. Lecture Notes in Computer Science. 4207. Springer Berlin Heidelberg: 167–181. doi:10

Enumeration reducibility (1,438 words) [view diff] no match in snippet view article find links to article

{\displaystyle (f)\leq _{e}} graph ( g ) . {\displaystyle (g).} Kleene's recursion theorem introduces the notion of relative partial recursiveness, which

Soft heap (1,250 words) [view diff] no match in snippet view article find links to article

In computer science, a soft heap is a variant on the simple heap data structure that has constant amortized time complexity for 5 types of operations.

Least fixed point (1,474 words) [view diff] no match in snippet view article find links to article

often have desirable properties that arbitrary fixed points do not. In computer science, the denotational semantics approach uses least fixed points to obtain

Set theory (6,673 words) [view diff] no match in snippet view article find links to article

a mathematical theory of infinity, and has various applications in computer science (such as in the theory of relational algebra), philosophy, formal semantics

Generator (computer programming) (3,271 words) [view diff] no match in snippet view article

In computer science, a generator is a routine that can be used to control the iteration behaviour of a loop. All generators are also iterators. A generator

Octree (1,486 words) [view diff] no match in snippet view article find links to article

points, which then recursively subdivides into its 8 octree regions. Recursion is stopped when a given exit condition is met. Examples of such exit conditions

Constant (computer programming) (2,687 words) [view diff] no match in snippet view article

languages since they favour programming styles with no side-effect (e.g., recursion) or make most declarations immutable by default, such as ML. Purely functional

Temporal Process Language (479 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, Temporal Process Language (TPL) is a process calculus which extends Robin Milner's CCS with the notion of multi-party

Reachability (2,453 words) [view diff] no match in snippet view article find links to article

as above for each step of the recursion which builds G 0 … , G k {\displaystyle G_{0}\ldots ,G_{k}} . As this recursion has logarithmic depth, a total

Memoization (3,833 words) [view diff] no match in snippet view article find links to article

alias when a call to the actual function is required (to avoid endless recursion), as illustrated below: function construct-memoized-functor (F is a function

Comparison of parser generators (1,133 words) [view diff] no match in snippet view article find links to article

Ascent-Descent Parser Generator". Electronic Notes in Theoretical Computer Science. Proceedings of the Ninth Workshop on Language Descriptions Tools and

Unifying Theories of Programming (966 words) [view diff] no match in snippet view article find links to article

Unifying Theories of Programming (UTP) in computer science deals with program semantics. It shows how denotational semantics, operational semantics and

NP (complexity) (2,784 words) [view diff] no match in snippet view article

problem in computer science P = ? N P {\displaystyle {\mathsf {P\ {\overset {?}{=}}\ NP}}} More unsolved problems in computer science In computational

Ordinal analysis (5,068 words) [view diff] no match in snippet view article find links to article

second-order arithmetic via update recursion". Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. ACM. pp. 1–11. doi:10.1145/3531130

Boolean algebra (9,596 words) [view diff] no match in snippet view article find links to article

satisfiability problem (SAT), and is of importance to theoretical computer science, being the first problem shown to be NP-complete. The closely related

Cartesian tree (4,294 words) [view diff] no match in snippet view article find links to article

In computer science, a Cartesian tree is a binary tree derived from a sequence of distinct numbers. To construct the Cartesian tree, set its root to be

Suffix array (3,775 words) [view diff] no match in snippet view article find links to article

In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compression

Boolean function (2,887 words) [view diff] no match in snippet view article find links to article

Alternative names are switching function, used especially in older computer science literature, and truth function (or logical function), used in logic

Presburger arithmetic (3,274 words) [view diff] no match in snippet view article find links to article

arithmetic theories: an exposition". In A. Nerode and R. Shore (ed.). Recursion Theory, American Mathematical Society. pp. 503–522. Zoethout, Jetze (February

Hilbert curve (1,285 words) [view diff] no match in snippet view article find links to article

Because of this locality property, the Hilbert curve is widely used in computer science. For example, the range of IP addresses used by computers can be mapped

Wheeler Jump (425 words) [view diff] no match in snippet view article find links to article

methodology is not particularly fast. It also is not capable of expressing recursion. The addition of new registers for this sort of duty was a key design

Spectrum of a sentence (1,365 words) [view diff] no match in snippet view article find links to article

(2007). Finite model theory and its applications. Texts in Theoretical Computer Science. An EATCS Series. Berlin: Springer-Verlag. doi:10.1007/3-540-68804-8

Mathematical induction (6,958 words) [view diff] no match in snippet view article find links to article

in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion. Mathematical induction is

Paradox (2,609 words) [view diff] no match in snippet view article find links to article

of paradoxes is non-terminating recursion, in the form of circular reasoning or infinite regress. When this recursion creates a metaphysical impossibility

Level ancestor problem (1,301 words) [view diff] no match in snippet view article find links to article

In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure

Hierarchy (5,918 words) [view diff] no match in snippet view article find links to article

of fields, such as architecture, philosophy, design, mathematics, computer science, organizational theory, systems theory, systematic biology, and the

Anne E. Carpenter (1,475 words) [view diff] no match in snippet view article find links to article

scientific platform for Recursion Pharmaceuticals. Dr. Carpenter is a member of the Scientific and Technical Advisory Board for Recursion Pharmaceuticals, in

C-- (1,295 words) [view diff] no match in snippet view article find links to article

Procedures can return multiple results. Tail recursion is explicitly requested with the "jump" keyword. /* Tail recursion */ export sp; sp(bits32 n) { jump sp_help(n

Kappa calculus (1,771 words) [view diff] no match in snippet view article find links to article

In mathematical logic, category theory, and computer science, kappa calculus is a formal system for defining first-order functions. Unlike lambda calculus

Ruy de Queiroz (1,250 words) [view diff] no match in snippet view article find links to article

theoretical computer science, including Set Theory, Recursion Theory (as a follow-up to a course given by Solomon Feferman), Logic for Computer Science, Discrete

Type theory (8,229 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical computer science, a type theory is the formal presentation of a specific type system. Type theory is the academic study

Automated theorem proving (2,933 words) [view diff] no match in snippet view article find links to article

mathematical proof was a major motivating factor for the development of computer science. While the roots of formalized logic go back to Aristotle, the end

Functional completeness (2,043 words) [view diff] no match in snippet view article find links to article

problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic

Quickselect (1,163 words) [view diff] no match in snippet view article find links to article

In computer science, quickselect is a selection algorithm to find the kth smallest element in an unordered list, also known as the kth order statistic

Autocode (1,096 words) [view diff] no match in snippet view article find links to article

language. It pre-dated ALGOL, having no concept of stacks and hence no recursion or dynamically-allocated arrays. In order to overcome the relatively small

Parity game (1,905 words) [view diff] no match in snippet view article find links to article

removed. We can now solve the smaller game G ′ {\displaystyle G'} by recursion and obtain a pair of winning sets W i ′ , W 1 − i ′ {\displaystyle W'_{i}

Leftist tree (2,359 words) [view diff] no match in snippet view article find links to article

In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node x has an s-value which

Principal type (668 words) [view diff] no match in snippet view article find links to article

However, many extensions to the type system of ML, such as polymorphic recursion, can make the inference of the principal type undecidable. Other extensions

Entropy compression (1,387 words) [view diff] no match in snippet view article find links to article

In mathematics and theoretical computer science, entropy compression is an information theoretic method for proving that a random process terminates, originally

Kolmogorov complexity (7,714 words) [view diff] no match in snippet view article find links to article

In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is

Compiler (8,075 words) [view diff] no match in snippet view article find links to article

implement nested function definitions with lexical scope. It included recursion. Its syntax was defined using BNF. ALGOL 60 inspired many languages that

Finite model theory (3,094 words) [view diff] no match in snippet view article find links to article

finite model theory became an "unusually effective" instrument in computer science. In other words: "In the history of mathematical logic most interest

Semantics (logic) (707 words) [view diff] no match in snippet view article

Algebraic semantics Formal semantics (natural language) Semantics (computer science) Syntax (logic) Jaakko Hintikka (2007), Socratic Epistemology: Explorations

Floyd–Warshall algorithm (3,098 words) [view diff] no match in snippet view article find links to article

In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm)

List object (397 words) [view diff] no match in snippet view article find links to article

branch of mathematics, and in its applications to logic and theoretical computer science, a list object is an abstract definition of a list, that is, a finite

Logical disjunction (1,937 words) [view diff] no match in snippet view article find links to article

problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic

Peter Landin (1,438 words) [view diff] no match in snippet view article find links to article

London. During the 1970s and 1980s, his efforts went into building the computer science department in Queen Mary College, developing courses, and teaching

Satisfiability modulo theories (4,379 words) [view diff] no match in snippet view article find links to article

In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable

Logical connective (3,183 words) [view diff] no match in snippet view article find links to article

then so does y . {\displaystyle y.} Logical connectives are used in computer science and in set theory. A truth-functional approach to logical operators

Speech (3,323 words) [view diff] no match in snippet view article find links to article

linguistics, cognitive science, communication studies, psychology, computer science, speech pathology, otolaryngology, and acoustics. Speech compares with

Self-reference (2,124 words) [view diff] no match in snippet view article find links to article

potentially paradoxical concepts into well-behaved recursions has been one of the great successes of computer science, and is now used routinely in, for example

Turing completeness (3,435 words) [view diff] no match in snippet view article find links to article

repetition; Haskell and Prolog, lacking looping almost entirely, would use recursion. Most programming languages are describing computations on von Neumann

Quantifier rank (516 words) [view diff] no match in snippet view article find links to article

(2007), Finite model theory and its applications, Texts in Theoretical Computer Science. An EATCS Series, Berlin: Springer-Verlag, p. 133, ISBN 978-3-540-00428-8

Sorting network (2,153 words) [view diff] no match in snippet view article find links to article

In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect

Automatic parallelization (1,696 words) [view diff] no match in snippet view article find links to article

dependence analysis is hard for code that uses indirect addressing, pointers, recursion, or indirect function calls because it is difficult to detect such dependencies

Type inference (3,747 words) [view diff] no match in snippet view article find links to article

mathematical type systems, but also natural languages in some branches of computer science and linguistics. Typeability is sometimes used quasi-synonymously with

Fixed-point logic (2,031 words) [view diff] no match in snippet view article find links to article

extensions of classical predicate logic that have been introduced to express recursion. Their development has been motivated by descriptive complexity theory

John Darlington (1,372 words) [view diff] no match in snippet view article find links to article

Darlington introduced a novel functional language, NPL, based on Kleene Recursion Equations that made an early contribution to the development of the multi-equational

Actor model and process calculi history (2,420 words) [view diff] no match in snippet view article find links to article

bound on the number of processes operating concurrently; there is no recursion and no facility for process-valued variables. In other respects also,

Communicating sequential processes (6,476 words) [view diff] no match in snippet view article find links to article

In computer science, communicating sequential processes (CSP) is a formal language for describing patterns of interaction in concurrent systems. It is

Intuitionistic type theory (4,646 words) [view diff] no match in snippet view article find links to article

trees. Later work in type theory generated coinductive types, induction-recursion, and induction-induction for working on types with more obscure kinds

Bunched logic (2,832 words) [view diff] no match in snippet view article find links to article

non-interference to be more flexibly mixed. This resolved open problems concerning recursion and jumps in Reynolds' system. Separation logic is an extension of Hoare

Jan Bergstra (898 words) [view diff] no match in snippet view article find links to article

recursion theory in higher types, under the supervision of Dirk van Dalen. Bergstra held posts at the Institute of Applied Mathematics and Computer Science

LOOP (programming language) (2,084 words) [view diff] no match in snippet view article

primitive recursion". Mathematische Annalen. 167: 53–55. doi:10.1007/BF01361215. S2CID 119730846. Axt, Paul (1970). "Iteration of primitive recursion". Journal

Gaussian orbital (1,616 words) [view diff] no match in snippet view article find links to article

this simplifies the equations. McMurchie and Davidson (1978) introduced recursion relations, which greatly reduces the amount of calculations. Pople and

Ray tracing hardware (2,140 words) [view diff] no match in snippet view article find links to article

individual ray renders. However, anything other than ray casting requires recursion of the ray tracing algorithm (and random access to the scene graph) to

Interpolation sort (2,325 words) [view diff] no match in snippet view article find links to article

i++) { if (bucket[i].length > 1) { bucket[i].interpolationSort(); } // Recursion for (var j = 0; j < bucket[i].length; j++) { this[start++] = bucket[i][j];

Computation in the limit (1,680 words) [view diff] no match in snippet view article find links to article

Chaitin's constant. There is a modified version of the limit lemma for α-recursion theory via functions in the α {\displaystyle \alpha } -arithmetical hierarchy

Metavariable (328 words) [view diff] no match in snippet view article find links to article

Atsushi Igarashi. "Calculi of Meta-variables[permanent dead link]" in Computer Science Logic. 17th International Workshop CSL 2003. 12th Annual Conference

Knowledge Based Software Assistant (2,091 words) [view diff] no match in snippet view article find links to article

was possible to specify transformations using patterns, wildcards, and recursion on both the right and left hand sides of a rule. The left hand expression

Non-well-founded set theory (1,479 words) [view diff] no match in snippet view article find links to article

the logical modelling of non-terminating computational processes in computer science (process algebra and final semantics), linguistics and natural language

Lindström's theorem (386 words) [view diff] no match in snippet view article find links to article

v t e Logic History Major fields Computer science Formal semantics (natural language) Inference Philosophy of logic Proof Semantics of logic Syntax Logics

Unification (computer science) (7,345 words) [view diff] no match in snippet view article

In logic and computer science, specifically automated reasoning, unification is an algorithmic process of solving equations between symbolic expressions

K-d tree (3,770 words) [view diff] no match in snippet view article find links to article

Wikimedia Commons has media related to k-d trees. In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure

Self-perpetuation (510 words) [view diff] no match in snippet view article find links to article

S2CID 145732747. self-stabilization, homeostasis self-replication self-reference recursion reproduction feedback loop cause and effect von Neumann universal constructor

TeX (6,173 words) [view diff] no match in snippet view article find links to article

systems. TeX is widely used in academia, especially in mathematics, computer science, economics, political science, engineering, linguistics, physics, statistics

Multiplication algorithm (6,707 words) [view diff] no match in snippet view article find links to article

recursion to merge together sub calculations. By rewriting the formula, one makes it possible to do sub calculations / recursion. By doing recursion,

Algorithmic skeleton (8,846 words) [view diff] no match in snippet view article find links to article

The specific cases correspond to: fixed recursion depth, constant recursion degree, multiple block recursion, elementwise operations, and correspondent

Computable number (3,270 words) [view diff] no match in snippet view article find links to article

CS1 maint: multiple names: authors list (link) P. Odifreddi, Classical Recursion Theory (1989), p.8. North-Holland, 0-444-87295-7 Turing (1936). Minsky

Goto (5,508 words) [view diff] no match in snippet view article find links to article

through single tail recursion (tail recursion calling the same function). Further, tail call optimization allows mutual recursion of unbounded depth,

Rule of inference (7,330 words) [view diff] no match in snippet view article find links to article

many areas, such as proofs in mathematics and automated reasoning in computer science. Their conceptual and psychological underpinnings are studied by philosophers

Computer-assisted proof (2,089 words) [view diff] no match in snippet view article find links to article

Metamath – Formal language and associated computer program Model checking – Computer science field Seventeen or Bust – Odd number with specific propertiesPages

Solomonoff's theory of inductive inference (2,093 words) [view diff] no match in snippet view article find links to article

introduced by Ray Solomonoff, based on probability theory and theoretical computer science. In essence, Solomonoff's induction derives the posterior probability

Raku (programming language) (5,619 words) [view diff] no match in snippet view article

ways: # Using recursion (with `if\else` construct) sub fact( UInt $n --> UInt ) { if $n == 0 { 1 } else { $n * fact($n-1) } } # Using recursion (with `if`

Geoffrey K. Pullum (2,633 words) [view diff] no match in snippet view article find links to article

Geoffrey K.; Scholz, Barbara C. (26 March 2010), "6. Recursion and the infinitude claim", Recursion and Human Language, De Gruyter Mouton, pp. 111–138,

Context-free grammar (6,138 words) [view diff] no match in snippet view article find links to article

invented by the linguist Noam Chomsky for this purpose. By contrast, in computer science, as the use of recursively defined concepts increased, they were used

Church encoding (9,317 words) [view diff] no match in snippet view article find links to article

proving. Operations can be typed using higher-ranked types, and primitive recursion is easily accessible. The assumption that functions are the only primitive

Thoralf Skolem (1,513 words) [view diff] no match in snippet view article find links to article

arithmetic of the natural numbers by first defining objects by primitive recursion, then devising another system to prove properties of the objects defined

Alexander Brudno (1,027 words) [view diff] no match in snippet view article find links to article

this card game was used in the seminar to refine the understanding of recursion and structured programming, and development of updatable dictionaries

Agda (programming language) (1,399 words) [view diff] no match in snippet view article

be omitted if they can be inferred. In core type theory, induction and recursion principles are used to prove theorems about inductive types. In Agda,

Comparison of DNS server software (3,360 words) [view diff] no match in snippet view article find links to article

above. Recursive A major category of DNS server functionality, see above. Recursion Access Control Servers with this feature provide control over which hosts

Tutte polynomial (5,379 words) [view diff] no match in snippet view article find links to article

the source of several central computational problems in theoretical computer science. The Tutte polynomial has several equivalent definitions. It is essentially

List of programming languages for artificial intelligence (1,278 words) [view diff] no match in snippet view article find links to article

associations, schemas (frames), dynamic memory allocation, data types, recursion, associative retrieval, functions as arguments, generators (streams),

Scope (computer science) (10,553 words) [view diff] no match in snippet view article

them, and requires forward declaration in some cases, notably for mutual recursion. In other languages, such as Python, a name's scope begins at the start

PL/I (12,126 words) [view diff] no match in snippet view article find links to article

computation, scientific computing, and system programming. It supports recursion, structured programming, linked data structure handling, fixed-point,

Random-access stored-program machine (2,620 words) [view diff] no match in snippet view article find links to article

In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development

Random-access stored-program machine (2,620 words) [view diff] no match in snippet view article find links to article

In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development

List of programming languages for artificial intelligence (1,278 words) [view diff] no match in snippet view article find links to article

associations, schemas (frames), dynamic memory allocation, data types, recursion, associative retrieval, functions as arguments, generators (streams),

Polynomial creativity (1,742 words) [view diff] no match in snippet view article find links to article

polynomial creativity is a theory analogous to the theory of creative sets in recursion theory and mathematical logic. The k {\displaystyle k} -creative sets

Descriptive complexity theory (2,549 words) [view diff] no match in snippet view article find links to article

expression. This augments first-order logic with the ability to express recursion. The Immerman–Vardi theorem, shown independently by Immerman and Vardi

Finitary relation (1,905 words) [view diff] no match in snippet view article find links to article

Rx1⋯xn and χR((x1, ..., xn)) = 0 otherwise. In applied mathematics, computer science and statistics, it is common to refer to a Boolean-valued function

Abstract model theory (169 words) [view diff] no match in snippet view article find links to article

axiomatization of abstract model theory. Lindström's theorem Institution (computer science) Institutional model theory Institution-independent model theory by

Generalized geography (1,908 words) [view diff] no match in snippet view article find links to article

workspace consumed is in the recursion stack. The space consumed by the recursion stack is polynomial because each level of recursion adds a single node to the

Sturmian word (1,929 words) [view diff] no match in snippet view article find links to article

( s n ) n ≥ 0 {\displaystyle (s_{n})_{n\geq 0}} defined by the above recursion is called the standard sequence for the standard word c α {\displaystyle

Complete theory (396 words) [view diff] no match in snippet view article find links to article

v t e Logic History Major fields Computer science Formal semantics (natural language) Inference Philosophy of logic Proof Semantics of logic Syntax Logics

Expression (mathematics) (5,359 words) [view diff] no match in snippet view article

infinitely many WFE's, however, each WFE has a finite number of nodes. In computer science, an expression is a syntactic entity in a programming language that

Faddeev–LeVerrier algorithm (2,492 words) [view diff] no match in snippet view article find links to article

{tr} A^{k}~;...} Observe A−1 = − Mn /c0 = (−1)n−1Mn/detA terminates the recursion at λ. This could be used to obtain the inverse or the determinant of A

Ternary conditional operator (2,301 words) [view diff] no match in snippet view article find links to article

Binary operator in computer programming McCarthy Formalism – Computer science and recursion theory Multiplexer – Device that selects between several analog

Busy beaver (7,959 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, the busy beaver game aims to find a terminating program of a given size that (depending on definition) either produces

Samplesort (3,298 words) [view diff] no match in snippet view article find links to article

each recursion step, the data gets copied to the other array in a partitioned fashion. If the data is in the temporary array in the last recursion step

Ordered pair (3,713 words) [view diff] no match in snippet view article find links to article

pairs are also called 2-tuples, or sequences (sometimes, lists in a computer science context) of length 2. Ordered pairs of scalars are sometimes called

Selection algorithm (5,800 words) [view diff] no match in snippet view article find links to article

In computer science, a selection algorithm is an algorithm for finding the k {\displaystyle k} th smallest value in a collection of ordered values, such

Continuation-passing style (2,526 words) [view diff] no match in snippet view article find links to article

will cause both the constructed continuation to potentially grow during recursion, and the call stack. This is usually undesirable, but has been used in

Matrix chain multiplication (2,579 words) [view diff] no match in snippet view article find links to article

for computing ABC also requires finding the best cost for AB. As the recursion grows deeper, more and more of this type of unnecessary repetition occurs

Peano axioms (6,478 words) [view diff] no match in snippet view article find links to article

problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic

Random-access machine (7,515 words) [view diff] no match in snippet view article find links to article

In computer science, random-access machine (RAM or RA-machine) is a model of computation that describes an abstract machine in the general class of register

ECLiPSe (755 words) [view diff] no match in snippet view article find links to article

modelling. A logical iteration construct eliminates the need for most simple recursion patterns. ECLiPSe provides comprehensive facilities to implement data-driven

Ezhil (programming language) (1,032 words) [view diff] no match in snippet view article

Python standard library Procedural programming using functions, supporting recursion, call-by-value etc. Ezhil as a language - it is not a macro-processor

Propositional logic (11,502 words) [view diff] no match in snippet view article find links to article

referred to by Colin Howson as the principle of composition. It is this recursion in the definition of a language's syntax which justifies the use of the

Substitution (logic) (2,933 words) [view diff] no match in snippet view article

van Leeuwen (ed.). Algebraic Specification. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 675–788., here: p. 682. From a term algebra

Range query (computer science) (5,468 words) [view diff] no match in snippet view article

In computer science, the range query problem consists of efficiently answering several queries regarding a given interval of elements within an array.

Hilbert's second problem (1,500 words) [view diff] no match in snippet view article find links to article

Impact on Logic, Mathematics, and Computer Science.". 2006 21st Annual IEEE Symposium on Logic in Computer Science. IEEE. pp. 339–341. doi:10.1109/LICS

Higher-order logic (1,066 words) [view diff] no match in snippet view article find links to article

Undecidability of the Second-Order Unification Problem" (PDF). Theoretical Computer Science. 13 (2): 225–230. doi:10.1016/0304-3975(81)90040-2. Huet, Gérard (2002)

Validity (logic) (1,110 words) [view diff] no match in snippet view article

v t e Logic History Major fields Computer science Formal semantics (natural language) Inference Philosophy of logic Proof Semantics of logic Syntax Logics

Mathematical structure (663 words) [view diff] no match in snippet view article find links to article

260.5111.1170. PMID 17806355. "Structure". PlanetMath. (provides a model theoretic definition.) Mathematical structures in computer science (journal)

Andrzej Grzegorczyk (2,886 words) [view diff] no match in snippet view article find links to article

represented sets, a model of computation for analysis. Logical Methods in Computer Science, Volume 7, Issue 2, pp. 1–21 Resnick, Rebecca Abigail (2011): Finding

Genetic programming (3,547 words) [view diff] no match in snippet view article find links to article

a recursive but terminating algorithm, allowing it to avoid infinite recursion. In the "autoconstructive evolution" approach to meta-genetic programming

Clique problem (9,905 words) [view diff] no match in snippet view article find links to article

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete

Program synthesis (2,875 words) [view diff] no match in snippet view article find links to article

In computer science, program synthesis is the task to construct a program that provably satisfies a given high-level formal specification. In contrast

Stream processing (4,604 words) [view diff] no match in snippet view article find links to article

In computer science, stream processing (also known as event stream processing, data stream processing, or distributed stream processing) is a programming

Metamathematics (1,674 words) [view diff] no match in snippet view article find links to article

the study of new pure mathematics, such as set theory, category theory, recursion theory and pure model theory. Serious metamathematical reflection began

Python (programming language) (11,182 words) [view diff] no match in snippet view article

2019. Retrieved 20 March 2018. van Rossum, Guido (22 April 2009). "Tail Recursion Elimination". Neopythonic.blogspot.be. Archived from the original on 19

Datalog (4,894 words) [view diff] no match in snippet view article find links to article

asks, given a Datalog program, whether it is bounded, i.e., the maximal recursion depth reached when evaluating the program on an input database can be

Connected relation (1,429 words) [view diff] no match in snippet view article find links to article

182. ISBN 978-1-4939-3223-8. Causey, Robert L. (1994). Logic, Sets, and Recursion. Jones & Bartlett Learning. ISBN 0-86720-463-X., p. 135 Paul R. Halmos

Function symbol (1,670 words) [view diff] no match in snippet view article find links to article

satisfiability problem for certain other equational theories, see Unification (computer science). As an example of uninterpreted functions for SMT-LIB, if this input

Term (logic) (2,813 words) [view diff] no match in snippet view article

distinct ground terms of a height up to h can be computed by the following recursion formula: θ0 = f0, since a ground term of height 0 can only be a constant

Pāṇini (6,331 words) [view diff] no match in snippet view article find links to article

72, pp. 79-94. Kadvany, John (2007), "Positional Value and Linguistic Recursion", Journal of Indian Philosophy, 35 (5–6): 487–520, CiteSeerX 10.1.1.565

Multi-pass compiler (628 words) [view diff] no match in snippet view article find links to article

Multiple passes obviate the need for forward declarations, allowing mutual recursion to be implemented elegantly. The prime examples of languages requiring

Context-sensitive language (1,457 words) [view diff] no match in snippet view article find links to article

Computer Science. An EATCS Series, Berlin: Springer-Verlag, p. 77, ISBN 978-3-540-22147-0, MR 2164257. Odifreddi, P. G. (1999), Classical recursion theory

Cache-oblivious algorithm (1,851 words) [view diff] no match in snippet view article find links to article

eventually fits in cache no matter how small the cache is, and end the recursion at some small size determined by the function-call overhead and similar

Disjoint-set data structure (4,912 words) [view diff] no match in snippet view article find links to article

In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection

Las Vegas algorithm (2,550 words) [view diff] no match in snippet view article find links to article

50%–50% because the depth of the recursion tree will still be O(logn) with O(n) times taken each level of recursion. The eight queens problem is usually

Negation (2,288 words) [view diff] no match in snippet view article find links to article

primitive rule ex falso quodlibet. As in mathematics, negation is used in computer science to construct logical statements. if (!(r == t)) { /*...statements executed

Binary operation (1,546 words) [view diff] no match in snippet view article find links to article

universal algebras to allow partial operations. Sometimes, especially in computer science, the term binary operation is used for any binary function. Typical

Knapsack problem (7,750 words) [view diff] no match in snippet view article find links to article

figure. The knapsack problem is interesting from the perspective of computer science for many reasons: The decision problem form of the knapsack problem

Hilary Putnam (9,058 words) [view diff] no match in snippet view article find links to article

science. Outside philosophy, Putnam contributed to mathematics and computer science. Together with Martin Davis he developed the Davis–Putnam algorithm

Intersection type discipline (2,539 words) [view diff] no match in snippet view article find links to article

variables". Theoretical Computer Science: 1–70. Terauchi, T., Aiken, A.: On typability for rank-2 intersection types with polymorphic recursion. In: LICS, IEEE

Axiomatic system (3,634 words) [view diff] no match in snippet view article find links to article

standard type of deductive logical structure, used also in theoretical computer science. It consists of a set of formal statements known as axioms that are

Venn diagram (3,241 words) [view diff] no match in snippet view article find links to article

set relationships in probability, logic, statistics, linguistics and computer science. A Venn diagram uses simple closed curves on a plane to represent sets

LL grammar (1,997 words) [view diff] no match in snippet view article find links to article

or may not be LALR(1). LL grammars cannot have rules containing left recursion. Each LL(k) grammar that is ε-free can be transformed into an equivalent

Val Tannen (452 words) [view diff] no match in snippet view article find links to article

subjects. One of Tannen’s major contributions is the use of structural recursion to define a query language for nested relations. This not only provided

Optimizing compiler (5,406 words) [view diff] no match in snippet view article find links to article

subroutine. This can often share code for subroutine set-up and sometimes tail-recursion. Trampolines Many[citation needed] CPUs have smaller subroutine call instructions

Program Inversion, Interpretation, and Injectivization (2,742 words) [view diff] no match in snippet view article find links to article

Kirkedal (2023). "Tail Recursion Transformation for Invertible Functions". Reversible Computation. Lecture Notes in Computer Science. Vol. 13960. pp. 73–88

Barbara Falkenbach Ryan (576 words) [view diff] no match in snippet view article find links to article

earned her Ph.D. in mathematics in 1968 at Cornell University, studying recursion theory under the supervision of Anil Nerode. Her dissertation was ω-Cohesive

Ramer–Douglas–Peucker algorithm (1,191 words) [view diff] no match in snippet view article find links to article

point, which includes the farthest point being marked as kept. When the recursion is completed a new output curve can be generated consisting of all and

Argument (4,260 words) [view diff] no match in snippet view article find links to article

argument is relevant for scientific fields such as mathematics and computer science. Logic is the study of the forms of reasoning in arguments and the

Factorization of polynomials over finite fields (4,636 words) [view diff] no match in snippet view article find links to article

applicability of the concept in other topics of mathematics and sciences like computer science there has been a resurgence of interest in finite fields and this is

Subset (1,734 words) [view diff] no match in snippet view article find links to article

descriptions of redirect targets Subset sum problem – Decision problem in computer science Subsumptive containment – System of elements that are subordinated

Jim Hefferon (673 words) [view diff] no match in snippet view article find links to article

Connecticut, where he obtained a PhD in Mathematics, specializing in recursion theory, as a student of Manuel Lerman. Jim Hefferon moved to Colchester

Interpretation (logic) (4,478 words) [view diff] no match in snippet view article

Many formal languages used in mathematics, logic, and theoretical computer science are defined in solely syntactic terms, and as such do not have any

Apartness relation (644 words) [view diff] no match in snippet view article find links to article

Schwichtenberg, H. (2000), Basic proof theory, Cambridge Tracts in Theoretical Computer Science, vol. 43 (2nd ed.), Cambridge University Press, Cambridge, p. 136,

Mathematics and art (12,531 words) [view diff] no match in snippet view article find links to article

polyhedra, originally as models for teaching. Mathematical concepts such as recursion and logical paradox can be seen in paintings by René Magritte and in engravings

Creative and productive sets (1,307 words) [view diff] no match in snippet view article find links to article

Enderton, Herbert B. (2010), Computability Theory: An Introduction to Recursion Theory, Academic Press, ISBN 978-0-12-384958-8. Joseph, Deborah; Young

Metalanguage (1,421 words) [view diff] no match in snippet view article find links to article

Study of mathematics itself Metalinguistic abstraction – Principle in computer science of domain-specific languages for problem solving Metalinguistic awareness –

Prefix sum (5,592 words) [view diff] no match in snippet view article find links to article

In computer science, the prefix sum, cumulative sum, inclusive scan, or simply scan of a sequence of numbers x0, x1, x2, ... is a second sequence of numbers

Outline of natural language processing (7,775 words) [view diff] no match in snippet view article find links to article

on. Natural-language processing is also the name of the branch of computer science, artificial intelligence, and linguistics concerned with enabling computers

System of linear equations (5,639 words) [view diff] no match in snippet view article find links to article

algebra, and play a prominent role in engineering, physics, chemistry, computer science, and economics. A system of non-linear equations can often be approximated

Mathematical constant (3,561 words) [view diff] no match in snippet view article find links to article

Also, it is related to the Fibonacci sequence, related to growth by recursion. Kepler proved that it is the limit of the ratio of consecutive Fibonacci

Queueing theory (4,806 words) [view diff] no match in snippet view article find links to article

1017/S0305004100036094. JSTOR 2984229. S2CID 62590290. Ramaswami, V. (1988). "A stable recursion for the steady state vector in markov chains of m/g/1 type". Communications

Random binary tree (5,297 words) [view diff] no match in snippet view article find links to article

In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees

Logical consequence (1,920 words) [view diff] no match in snippet view article find links to article

v t e Logic History Major fields Computer science Formal semantics (natural language) Inference Philosophy of logic Proof Semantics of logic Syntax Logics

Word problem (mathematics) (3,200 words) [view diff] no match in snippet view article

finitely presented groups with Higman's embedding theorem, connecting recursion theory with group theory in an unexpected way and giving a very different

Logical truth (1,094 words) [view diff] no match in snippet view article find links to article

v t e Logic History Major fields Computer science Formal semantics (natural language) Inference Philosophy of logic Proof Semantics of logic Syntax Logics

Lambda cube (3,236 words) [view diff] no match in snippet view article find links to article

is the types in prenex normal form. However, because they feature some recursion operators, their computing power is greater than that of λ2. The Coq system

Gödel, Escher, Bach (1,797 words) [view diff] no match in snippet view article find links to article

another, but slower and negated. The book contains many instances of recursion and self-reference, where objects and ideas speak about or refer back

Quickhull (1,052 words) [view diff] no match in snippet view article find links to article

new sides of the triangle. Continue until no more points are left, the recursion has come to an end and the points selected constitute the convex hull

Vienna Development Method (5,172 words) [view diff] no match in snippet view article find links to article

of critical systems, compilers, concurrent systems and in logic for computer science. Computing systems may be modeled in VDM-SL at a higher level of abstraction

Foundations of mathematics (7,131 words) [view diff] no match in snippet view article find links to article

computability and computational complexity theory, and more recently, parts of computer science. Subsequent discoveries in the 20th century then stabilized the foundations

Computable topology (3,333 words) [view diff] no match in snippet view article find links to article

type free λ-calculus is an effective computability equivalent to general recursion and Turing machines. The set of λ-terms can be considered a functional

Setoid (532 words) [view diff] no match in snippet view article find links to article

Categories—an Intuitionistic Perspective", Electronic Notes in Theoretical Computer Science 218 (2008) 21–32. "Bishop's set theory" (PDF). p. 9. Hofmann, Martin