Explore >> Select a destination
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
emanueleviola.wordpress.com
|
|
| | | | | This is a book about computational complexity theory. However, it is perhaps sui generis for various reasons: 1. The presentation is also geared towards an algorithmic audience. Our default model is the RAM (Chapter 1), the standard model for algorithmic research. This is in contrast with other texts which focus on tape machines. I reduce... | |
| | | | |
pressron.wordpress.com
|
|
| | | | | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... | |
| | | | |
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. | |
| | | | |
jdh.hamkins.org
|
|
| | | I have been reading Alan Turing's paper, On computable numbers, with an application to the entsheidungsproblem, an amazing classic, written by Turing while he was a student in Cambridge. This... | ||
