6,052 articles
Term rewriting system
A term rewriting system (TRS) is a formal computational model that computes by repeatedly replacing subterms with matching rewrite rules, underlying theorem provers, optimizing compilers, and computer algebra systems.
Term test
The term test, also called the nth-term test or divergence test, is a series criterion: if the terms do not tend to zero, the series diverges; vanishing terms alone prove nothing.
Terminal and nonterminal symbols
Terminal and nonterminal symbols are the two kinds of symbols in a formal grammar: terminals appear in final strings, while nonterminals are rewritten until only terminals remain.
Ternary numeral system
The ternary numeral system, also known as base 3, is a positional number system using the digits 0, 1, and 2, with place values that are powers of 3.
Tessellation
A tessellation, also called a tiling, is a pattern of shapes covering a surface without gaps or overlaps, ranging from square grids to patterns that never repeat.
Tesseract
The tesseract is the four-dimensional analog of the cube, also called the hypercube or 8-cell, one of the six convex regular 4-polytopes, with 16 vertices and 8 cubic cells.
Test statistic
A test statistic is a quantity computed from sample data, compared against a known distribution or critical value, to decide whether to reject a null hypothesis.
Tetractys (τετρακτύς)
The tetractys (τετρακτύς, Tetraktys) is a triangular figure of ten points in four rows of one, two, three, and four, revered by the Pythagoreans and sworn upon in their oaths.
Tetrahedron
A tetrahedron, also called a triangular pyramid, is a polyhedron with four triangular faces, six edges, and four vertices; the regular tetrahedron is the smallest Platonic solid.
Tetration
Tetration, also known as super-exponentiation or hyper4, is the fourth hyperoperation: it iterates exponentiation into a power tower, giving extreme growth like 3↑↑3 = 7625597484987.
Texas Instruments signing key controversy
The Texas Instruments signing key controversy followed the 2009 factoring of RSA keys TI uses to sign calculator software, and legal threats against hobbyists who published them.
Thales's theorem
Thales's theorem, also known as the theorem of Thales or angle in a semi-circle, states that any angle inscribed in a semicircle is a right angle.
The Analyst
The Analyst, also known as Berkeley's Analyst, is a 1734 pamphlet by George Berkeley attacking the logical foundations of the calculus, dismissing fluxions as "ghosts of departed quantities".
The Black Swan (Taleb book)
The Black Swan: The Impact of the Highly Improbable is a 2007 book by Nassim Nicholas Taleb arguing that rare, unpredictable, high-impact events dominate finance and history.
The Compendious Book on Calculation by Completion and Balancing
The Compendious Book on Calculation by Completion and Balancing is an Arabic treatise on algebra written by al-Khwarizmi in Baghdad around 820; its title gave the word "algebra."
The Fibonacci Association
The Fibonacci Association is an American non-profit mathematical society founded in 1963 to promote research on Fibonacci numbers, publishing The Fibonacci Quarterly and holding a biennial international conference.
Theil–Sen estimator
The Theil–Sen estimator is a robust method for fitting a line to data by taking the median of slopes through all pairs of points, resistant to outliers.
Theorem
A theorem is a statement in mathematics or logic proved from axioms by valid inference, in contrast with an unproved conjecture or an accepted axiom.
Theorem of the highest weight
The theorem of the highest weight, or theorem on highest weights, is a classification theorem in representation theory that classifies finite-dimensional irreducible representations of a semisimple Lie algebra by dominant integral weights.
Theorema Egregium
The Theorema Egregium, Latin for "remarkable theorem", is Gauss's 1827 result that a surface's Gaussian curvature is intrinsic, unchanged by any bending that preserves distances within it.
Theoretical computer science
Theoretical computer science (TCS) is the branch of computer science studying the fundamental capabilities and limits of computation using mathematical methods, originating with Turing and Church in the 1930s.
Theories of truth
Theories of truth are philosophical accounts of what it is for a proposition or belief to be true, including the correspondence, coherence, pragmatic, semantic, and deflationary theories.
Theory of computation
The theory of computation, also called computation theory, is the branch of computer science and mathematics that studies what problems machines can solve in principle and at what cost.
Therefore sign
The therefore sign (∴), or therefore symbol, is a three-dot symbol used in mathematics and logic to introduce a conclusion, first published in 1659; its inverted mirror means 'because'.
Theta correspondence
The theta correspondence is a representation theory correspondence that transfers irreducible representations between two reductive groups forming a dual pair inside a symplectic group, via the Weil representation.
Thickness (graph theory)
Thickness, or graph thickness, is a graph-theoretic parameter measuring how far a graph is from planar, defined as the minimum number of planar subgraphs covering its edges.
Thin plate spline
A thin plate spline (TPS) is a smooth surface fitted to scattered data by minimizing bending energy, introduced by Jean Duchon in 1976 and used in spatial statistics and image registration.
Thomas Harriot
Thomas Harriot, also spelled Hariot, was an English mathematician and astronomer (c. 1560–1621) who drew the Moon telescopically before Galileo and found the law of refraction.
Thompson sampling
Thompson sampling is a randomized Bayesian algorithm for the multi-armed bandit problem, proposed by William R. Thompson in 1933, that selects each action with its posterior probability of being optimal.
Thompson sporadic group
The Thompson sporadic group, written Th and also known as F₃, is one of the 26 sporadic finite simple groups, discovered by John G. Thompson in the mid-1970s.