Search Results for ""

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

Bessel's correction is the factor (N-1)/N in the relationship between the variance sigma and the expectation values of the sample variance, <s^2>=(N-1)/Nsigma^2, (1) where ...

The symbol intersection , used for the intersection of sets, and sometimes also for the logical connective AND instead of the symbol ^ (wedge). In fact, for any two sets A ...

The connected sum M_1#M_2 of n-manifolds M_1 and M_2 is formed by deleting the interiors of n-balls B_i^n in M_i^n and attaching the resulting punctured manifolds M_i-B^._i ...

The covariant derivative of a contravariant tensor A^a (also called the "semicolon derivative" since its symbol is a semicolon) is given by A^a_(;b) = ...

The symbol union , used for the union of sets, and, sometimes, also for the logical connective OR instead of the symbol v (vee). In fact, for any two sets A and B x in A ...

The term discrete percolation is used to describe models of percolation theory whose media are discrete sets like sets of regular lattice points (e.g., bond percolation and ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...

A stationary point process X is said to drive a model of continuum percolation theory if one of the characterizing axioms of the model hinges on the existence of X. In this ...

Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...