Probability is ordinarily used to describe an attitude of mind towards some proposition of whose truth we are not certain. The proposition of interest is usually of the form "Will a specific event occur?" The attitude of mind is of the form "How certain are we that the event will occur?" The certainty we adopt can be described in terms of a numerical measure and this number, between 0 and 1, we call probability.
more from Wikipedia
Combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size, deciding when certain criteria can be met, and constructing and analyzing objects meeting the criteria, finding "largest", "smallest", or "optimal" objects, and studying combinatorial structures arising in an algebraic context, or applying algebraic techniques to combinatorial problems.
more from Wikipedia
Set (mathematics)
A set is a collection of well defined and distinct objects, considered as an object in its own right. Sets are one of the most fundamental concepts in mathematics. Developed at the end of the 19th century, set theory is now a ubiquitous part of mathematics, and can be used as a foundation from which nearly all of mathematics can be derived.
more from Wikipedia
Big O notation
In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is called Landau notation, Bachmann–Landau notation, or asymptotic notation. In computer science, big O notation is used to classify algorithms by how they respond (e.g. , in their processing time or working space requirements) to changes in input size.
more from Wikipedia
PCP theorem
In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and logarithmic randomness complexity (uses a logarithmic number of random bits).
more from Wikipedia
Cardinality of the continuum
In set theory, the cardinality of the continuum is the cardinality or “size” of the set of real numbers, sometimes called the continuum. It is an infinite cardinal number and is denoted by or (a lowercase fraktur script c). The real numbers are more numerous than the natural numbers . Moreover, has the same number of elements as the power set of .
more from Wikipedia
Amplifier
An amplifier is a device for increasing the power of a signal by use of an external energy source. In an electronic amplifier, the input "signal" is usually a voltage or a current. Other types exist; a fluidic amplifier increases the power of signals represented as flow of gas or liquid, for example. Amplifiers may be classified in a variety of ways depending on their application, the frequency range they cover, or the active devices used.
more from Wikipedia
Constraint (mathematics)
In mathematics, a constraint is a condition that a solution to an optimization problem is required by the problem itself to satisfy. There are two types of constraints: equality constraints and inequality constraints. The set of candidate solutions that satisfy all constraints is called the feasible set.
more from Wikipedia