Combinatory logicCombinatory logic is a notation to eliminate the need for quantified variables in mathematical logic. It was introduced by Moses 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 of functional programming languages. It is based on combinators, which were introduced by Schönfinkel in 1920 with the idea of providing an analogous way to build up functions—and to remove any mention of variables—particularly in predicate logic.
Turing reductionIn computability theory, a Turing reduction from a decision problem to a decision problem is an oracle machine which decides problem given an oracle for (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to solve if it had available to it a subroutine for solving . The concept can be analogously applied to function problems. If a Turing reduction from to exists, then every algorithm for can be used to produce an algorithm for , by inserting the algorithm for at each place where the oracle machine computing queries the oracle for .
Abstract object theoryAbstract object theory (AOT) is a branch of metaphysics regarding abstract objects. Originally devised by metaphysician Edward Zalta in 1981, the theory was an expansion of mathematical Platonism. Abstract Objects: An Introduction to Axiomatic Metaphysics (1983) is the title of a publication by Edward Zalta that outlines abstract object theory. AOT is a dual predication approach (also known as "dual copula strategy") to abstract objects influenced by the contributions of Alexius Meinong and his student Ernst Mally.
Color fieldColor field painting is a style of abstract painting that emerged in New York City during the 1940s and 1950s. It was inspired by European modernism and closely related to abstract expressionism, while many of its notable early proponents were among the pioneering abstract expressionists. Color field is characterized primarily by large fields of flat, solid color spread across or stained into the canvas creating areas of unbroken surface and a flat picture plane.
Abstract machineIn computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions. It is similar to a mathematical function in that it receives inputs and produces outputs based on predefined rules. Abstract machines vary from literal machines in that they are expected to perform correctly and independently of hardware. Abstract machines are "machines" because they allow step-by-step execution of programmes; they are "abstract" because they ignore many aspects of actual (hardware) machines.
