normal form representation
101Continuation-passing style — In functional programming, continuation passing style (CPS) is a style of programming in which control is passed explicitly in the form of a continuation. Gerald Jay Sussman and Guy L. Steele, Jr. coined the phrase in AI Memo 349 (1975), which… …
102Symmetric matrix — In linear algebra, a symmetric matrix is a square matrix, A , that is equal to its transpose:A = A^{T}. ,!The entries of a symmetric matrix are symmetric with respect to the main diagonal (top left to bottom right). So if the entries are written… …
103Zech's logarithms — are used with finite fields to reduce a high degree polynomial that is not in the field to an element in the field (thus having a lower degree). Unlike the traditional logarithm, the Zech s logarithm of a polynomial provides an equivalence mdash; …
104Attribute-value system — An attribute value system is a basic knowledge representation framework comprising a table with columns designating attributes (also known as properties , predicates, features, dimensions, characteristics or independent variables depending on the …
105History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …
106History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …
107Zero–sum game — For other uses, see Zero sum (disambiguation). In game theory and economic theory, a zero sum game is a mathematical representation of a situation in which a participant s gain (or loss) of utility is exactly balanced by the losses (or gains) of… …
108Band matrix — In mathematics, particularly matrix theory, a band matrix is a sparse matrix whose non zero entries are confined to a diagonal band, comprising the main diagonal and zero or more diagonals on either side. Contents 1 Matrix bandwidth 2… …
109Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …
110Dimensional analysis — In physics and all science, dimensional analysis is a tool to find or check relations among physical quantities by using their dimensions. The dimension of a physical quantity is the combination of the basic physical dimensions (usually mass,… …
