Search results

{{for|Rosser's technique for proving incompleteness theorems|Rosser's trick}} ...ath>n</math>-th Prime is Greater than <math>n\log n</math>". ''Proceedings of the London Mathematical Society'' '''45''':21-44, 1939. {{doi|10.1112/plms/ ...

...is an important theorem about the [[Computational complexity|complexity]] of [[computable function]]s. Given a [[Gödel numbering]] <math>\varphi</math> of the computable functions and a [[Blum complexity measure]] <math>\Phi</math ...

{{short description|Affirms the existence of a computable universal function}} ...is an abstract version of the [[universal Turing machine]], thus the name of the theorem. ...

{{Short description|Concept in mathematics}} ...xtension''' is a supertheory which is not conservative, and can prove more theorems than the original. ...

...this kind were obtained by [[Michael Atiyah]] and [[Friedrich Hirzebruch]] in 1959, reducing the requirements to something like a [[spin structure]]. ...''v''_''f''=''f''^*(''TY'') &minus; ''TX'' in the [[K theory|K-group]] ...

{{Short description|Theorem in order theory and lattice theory}} ...d-point theorem in lattice theory|the fixed-point theorem in computability theory|Kleene's recursion theorem}} ...

{{short description|Highest possible rate of computation in this universe}} .... 5th Berkeley Symposium on Mathematical Statistics and Probability; Univ. of California Press, Berkeley, California.</ref> ...

...Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic ...n]] [[Raymond Smullyan]]. It contains many nontrivial recreational puzzles of the sort for which Smullyan is well known. It is also a gentle and humorous ...

{{Short description|Numbers whose sum of divisors is twice the number plus 1}} ...ath>) is equal to <math>2n + 1</math>. Equivalently, {{mvar|n}} is the sum of its non-trivial divisors (that is, its divisors excluding 1 and {{mvar|n}}) ...

...[[acyclic sheaf|acyclic]] [[injective resolution|resolution]] of the sheaf in question. ...l space]] <math>X</math> and <math>\mathcal F^\bullet</math> a resolution of <math>\mathcal F</math> by acyclic sheaves. Then ...

...]] that computes the membership of every natural number in a finite number of steps. A set is noncomputable (or undecidable) if it is not computable. A subset <math>S</math> of the [[natural number]]s is '''computable''' if there exists a [[total funct ...

...ple Lie group]]s by V. A. Kaimanovich and further generalized in the works of [[David Ruelle]], [[Grigory Margulis]], [[Anders Karlsson (mathematician)|A ...limits and describes the Lyapunov exponents. It does not address the rate of convergence. ...

{{short description|Theorems whose content is effectively computable}} ...tion is whether in principle the list could be printed out after a machine computation. ...

...heorem is named after [[Witold Hurewicz]], and generalizes earlier results of [[Henri Poincaré]]. ==Statement of the theorems== ...

...heory]], the '''craps principle''' is a theorem about [[Event (probability theory)|event]] [[probabilities]] under repeated [[Independent and identically-dis ...ellette|title=The Calculus Diaries: How Math Can Help You Lose Weight, Win in Vegas, and Survive a Zombie Apocalypse|url=https://books.google.com/books?i ...

...in terms of the [[Dedekind eta function]]. There are many generalizations of it to more complicated Eisenstein series. It is named for [[Leopold Kroneck for Re(''s'') > 1, and by analytic continuation for other values of the [[complex number]] ''s''. ...

{{Short description|Overview of and topical guide to computer science}} part of the set of 830+ outlines listed at ...

...cessor|many-core]] computer architectures. These computer systems make use of [[arbiter (electronics)|arbiters]] which gives rise to [[nondeterministic a ==A supposed limitation of logic programming== ...

{{Short description|Type of Turing machine}} ...'''linear bounded automata''', abbreviated '''LBA''') is a restricted form of [[Turing machine]]. ...

...eir paper titled ''NP is as easy as detecting unique solutions'' published in 1986.<ref>{{Cite journal | last1 = Valiant | first1 = L. | last2 = Vazirani ...nt. In the first case, an algorithm for Unambiguous-SAT should reject, and in the second it should accept the formula. ...