general recursive class
101Ambiguity — Sir John Tenniel s illustration of the Caterpillar for Lewis Carroll s Alice s Adventures in Wonderland is noted for its ambiguous central figure, whose head can be viewed as being a human male s face with a pointed nose and pointy chin or being… …
102Denotational semantics — In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach to formalizing the meanings of programming languages by constructing mathematical objects (called denotations)… …
103A New Kind of Science —   Author(s) Stephen Wolfram Country …
104ELEMENTARY — In computational complexity theory, the complexity class ELEMENTARY is the union of the classes in the exponential hierarchy.: egin{matrix} m{ELEMENTARY} = m{EXP}cup m{2EXP}cup m{3EXP}cupcdots = m{DTIME}(2^{n})cup m{DTIME}(2^{2^{n)cup… …
105Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… …
106Ontology — This article concerns ontology in philosophy. For the concept in information science, see Ontology (information science). Not to be confused with the medical concepts of oncology and odontology, or indeed ontogeny. Parmenides was among the first… …
107Propaganda — This article is about the form of communication. For other uses, see Propaganda (disambiguation). French Military Propaganda postcard showing a caricature of Kaiser Wilhelm II biting the world (c. 1915) …
108Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… …
109Meaning (linguistics) — In linguistics, meaning is what is expressed by the writer or speaker, and what is conveyed to the reader or listener, provided that they talk about the same thing (law of identity). In other words if the object and the name of the object and the …
110Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… …
