• Cobham's theorem is a theorem in combinatorics on words that has important connections with number theory, notably transcendental numbers, and automata...
    17 KB (2,524 words) - 00:20, 24 June 2025
  • solutions are characterized by having polynomial time,[B] and for Cobham's theorem on the sets of numbers that can be recognized by finite automata.[C]...
    6 KB (333 words) - 16:31, 19 February 2025
  • Cobham's thesis, also known as the Cobham–Edmonds thesis (named after Alan Cobham and Jack Edmonds), asserts that computational problems can be feasibly...
    7 KB (685 words) - 04:33, 15 April 2025
  • obtainable in this way. This result is due to Cobham, and it is referred to in the literature as Cobham's little theorem. Let k ≥ 2. The k-kernel of the sequence...
    23 KB (3,157 words) - 06:16, 3 July 2025
  • the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally, these theorems say that given more...
    17 KB (2,511 words) - 13:43, 5 June 2025
  • (2006). "A generalization of Cobham's theorem for regular sequences". Séminaire Lotharingien de Combinatoire. 54A. Cobham, A. (1969). "On the base-dependence...
    14 KB (2,353 words) - 19:12, 31 January 2025
  • machine using a polynomial amount of computation time, or polynomial time. Cobham's thesis holds that P is the class of computational problems that are "efficiently...
    15 KB (1,940 words) - 10:17, 2 June 2025
  • mathematical queueing theory, Little's law (also result, theorem, lemma, or formula) is a theorem by John Little which states that the long-term average...
    16 KB (1,827 words) - 06:18, 2 June 2025
  • {\displaystyle n} , then the algorithm is said to be a polynomial time algorithm. Cobham's thesis argues that a problem can be solved with a feasible amount of resources...
    50 KB (6,704 words) - 19:18, 26 May 2025
  • Thumbnail for Jack Edmonds
    mathematics, he proved the matroid intersection theorem, a very general combinatorial min-max theorem which, in modern terms, showed that the matroid...
    16 KB (1,543 words) - 09:32, 10 September 2024
  • Recognizability of Sets of Natural Numbers by Automata: New Proofs of Cobham's and Semenov's Theorems". Annals of Pure and Applied Logic. 77 (3): 251–277. doi:10...
    24 KB (3,255 words) - 01:19, 27 June 2025
  • below). Just as the class P can be thought of as the tractable problems (Cobham's thesis), so NC can be thought of as the problems that can be efficiently...
    22 KB (3,079 words) - 20:38, 19 June 2025
  • Thumbnail for NP-completeness
    The concept of NP-completeness was introduced in 1971 (see Cook–Levin theorem), though the term NP-complete was introduced later. At the 1971 STOC conference...
    30 KB (3,618 words) - 08:25, 21 May 2025
  • means "easy" and "not in P" means "difficult", an assumption known as Cobham's thesis. It is a common assumption in complexity theory; but there are caveats...
    63 KB (7,784 words) - 06:53, 25 April 2025
  • symbols for all polynomial-time algorithms introduced inductively using Cobham's characterization of polynomial-time functions. Axioms and derivations of...
    11 KB (1,510 words) - 08:00, 6 January 2025
  • Thumbnail for Time complexity
    class P, which is central in the field of computational complexity theory. Cobham's thesis states that polynomial time is a synonym for "tractable", "feasible"...
    41 KB (4,997 words) - 15:01, 30 May 2025
  • Undecidable theories. North Holland. Vaught, Robert L. (1966). "On a Theorem of Cobham Concerning Undecidable Theories". Studies in Logic and the Foundations...
    15 KB (1,839 words) - 12:30, 24 April 2025
  • contains no block of three consecutive 1s. More succinctly, by Cobham's little theorem the Baum–Sweet word can be expressed as a coding τ {\displaystyle...
    7 KB (994 words) - 02:39, 26 December 2024
  • is gone.[clarification needed] Its meaning was translated in 1898 by E. Cobham Brewer in the forms "When I am dead the deluge may come for aught I care"...
    16 KB (1,700 words) - 14:19, 28 June 2025
  • Thumbnail for Brook Taylor
    mathematical analysis. Taylor's most famous developments are Taylor's theorem and the Taylor series, essential in the infinitesimal approach of functions...
    12 KB (1,235 words) - 16:57, 13 June 2025
  • Henrik Abel, Norwegian mathematician – Abelian group, Abel's theorem, Abel–Ruffini theorem Helmut Abt, German-born American astrophysicist - Abt's star...
    118 KB (11,201 words) - 03:44, 25 June 2025
  • introduced in the notion of self-definability to derive a proof of the Cobham-Semenov theorem. He earned his Ph.D. in 2001. Subsequently, he worked at the Institute...
    5 KB (514 words) - 02:58, 12 April 2024
  • Thumbnail for University of Orléans
    for his Fermat's principle for light propagation and his Fermat's Last Theorem in number theory St Ivo of Kermartin (died 1303), patron of lawyers Étienne...
    10 KB (859 words) - 23:30, 2 May 2025
  • Thumbnail for Charles Babbage
    Braun (2004). An Eponymous Dictionary of Economics: A Guide To Laws And Theorems Named After Economists. Edward Elgar Publishing. p. 13. ISBN 978-1-84542-360-5...
    113 KB (12,387 words) - 17:33, 21 June 2025
  • the Cobham–Semënov theorem, if a relation is definable in both k and l Büchi arithmetics, then it is definable in Presburger arithmetic. Cobham, Alan...
    3 KB (422 words) - 13:00, 12 July 2023
  • Thumbnail for History of energy
    time-translation symmetry.[citation needed] That is according to Noether's theorem relating symmetries and conserved quantity, energy is conserved because...
    10 KB (1,248 words) - 00:16, 3 July 2025
  • Thumbnail for Currency union
    Retrieved 2018-08-22. Cobham, David (2004-09-15). "Alternative currency arrangements for a new Palestinian state" (PDF). In David Cobham (ed.). The Economics...
    36 KB (2,438 words) - 23:12, 14 March 2025
  • Thumbnail for George Boole
    that it is valid if they are independent in the second sense. While his theorems are true if all propositions or events involved are independent in the...
    64 KB (7,418 words) - 13:00, 24 June 2025
  • logspace. BPL is contained in L/poly, which is a variant of Adleman's theorem. Complexity Zoo: L/poly. Thierauf, Thomas (2000), The Computational Complexity...
    4 KB (443 words) - 21:18, 5 July 2021
  • Thumbnail for John William Strutt, 3rd Baron Rayleigh
    perturbation Group velocity Hanle effect Helmholtz minimum dissipation theorem Laminar–turbulent transition Langmuir–Blodgett trough List of presidents...
    27 KB (2,431 words) - 11:47, 28 June 2025