/explore
|
You are here 
|
qchu.wordpress.com | ||
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | Given two integers $latex n$ and $latex k$, where $latex k$ is non-negative, an ordered $latex k$-partition of $latex n$ is a $latex k$-tuple $latex (m_1, \dotsc, m_k)$ of positive integers such that $latex \displaystyle m_1 + \dotsb + m_k = n. $ For example, the ordered 3-partitions of 5 are $latex (1, 1, 3)$,... | |
| | | | |
thatsmaths.com
|
|
| | | | | The Riemann Hypothesis Perhaps the greatest unsolved problem in mathematics is to explain the distribution of the prime numbers. The overall ``thinning out'' of the primes less than some number $latex {N}&fg=000000$, as $latex {N}&fg=000000$ increases, is well understood, and is demonstrated by the Prime Number Theorem (PNT). In its simplest form, PNT states that... | |
| | | | |
jasoncrane.org
|
|
| | | [AI summary] A personal reflection by Jason Crane on sound, vision, and nostalgia inspired by David Bowie's Low album | ||
