decidable language
121PSPACE — Unsolved problems in computer science Is P = PSPACE ? PSPACE …
122Recursive 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… …
123Generalized star height problem — The generalized star height problem in formal language theory is the open question whether all regular languages can be expressed using regular expressions with a built in complement operator of limited star height, i. e. with a limited nesting… …
124Const-correctness — In computer science, const correctness is the form of program correctness that deals with the proper declaration of objects as mutable or immutable. The term is mostly used in a C or C++ context, and takes its name from the const keyword in those …
125Dynamic logic (modal logic) — For the subject in digital electronics also known as clocked logic, see dynamic logic (digital electronics). Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs and later applied to more general… …
126π-calculus — In theoretical computer science, the π calculus (or pi calculus) is a process calculus originally developed by Robin Milner, Joachim Parrow and David Walker as a continuation of work on the process calculus CCS (Calculus of Communicating Systems) …
127Serialism — In music, serialism is a technique for composition that uses sets to describe musical elements, and allows the manipulation of those sets.Fact|date=May 2008 Serialism is often, though not universally, held to begin with twelve tone technique,… …
128List of philosophy topics (D-H) — DDaDai Zhen Pierre d Ailly Jean Le Rond d Alembert John Damascene Damascius John of Damascus Peter Damian Danish philosophy Dante Alighieri Arthur Danto Arthur C. Danto Arthur Coleman Danto dao Daodejing Daoism Daoist philosophy Charles Darwin… …
