- Resolution (logic) - Wikipedia
A resolution technique When coupled with a complete search algorithm, the resolution rule yields a sound and complete algorithm for deciding the satisfiability of a propositional formula, and, by extension, the validity of a sentence under a set of axioms
- Algorithmic composition - Wikipedia
For example, since the 1970s fractals have been studied also as models for algorithmic composition As an example of deterministic compositions through mathematical models, the On-Line Encyclopedia of Integer Sequences provides an option to play an integer sequence as 12-tone equal temperament music
- Genetic programming - Wikipedia
Genetic programming (GP) is an evolutionary algorithm, an artificial intelligence technique mimicking natural evolution, which operates on a population of programs It applies the genetic operators selection according to a predefined fitness measure, mutation and crossover
- Boolean algebra - Wikipedia
For example, the empirical observation that one can manipulate expressions in the algebra of sets, by translating them into expressions in Boole's algebra, is explained in modern terms by saying that the algebra of sets is a Boolean algebra (note the indefinite article)
- Encryption - Wikipedia
For example, the Computer Security Institute reported that in 2007, 71% of companies surveyed used encryption for some of their data in transit, and 53% used encryption for some of their data in storage [20] Encryption can be used to protect data "at rest", such as information stored on computers and storage devices (e g USB flash drives)
- Reduction (complexity) - Wikipedia
As described in the example above, there are two main types of reductions used in computational complexity theory, the many-one reduction and the Turing reduction Many-one reductions map instances of one problem to instances of another; Turing reductions compute the solution to one problem, assuming the other problem is easy to solve The many-one reduction is a stronger type of Turing
|