/explore
|
You are here 
|
inquiryintoinquiry.com | ||
| | | | |
thehousecarpenter.wordpress.com
NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... |
|
| | | | | ||
| | | | |
www.jeremykun.com
Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility. |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
warsoflouisxiv.blogspot.com
Today's anniversary. Here and here on Kronoskaf |
|
| | | |||
