Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
inquiryintoinquiry.com
|
|
| | | | | Re: R.J. Lipton and K.W. Regan ? Proving Cook's Theorem Synchronicity Rules? I just started reworking an old exposition of mine on Cook's Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it into the cactus graph syntax for propositional calculus I developed as an extension of Peirce's... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | This half of the theory of computing primer will cover the various finite automata, including deterministic, nondeterministic, and pushdown automata. We devote the second half [upcoming] entirely to Turing machines and the halting problem, but to facilitate the discussion of Turing machines we rely on the intuition and notation developed here. Defining Computation The first... | |
| | | | |
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. | |
| | | | |
pdimov.github.io
|
|
| | | |||
