/explore
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
scottaaronson.blog
The Blog of Scott Aaronson |
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
www.quantamagazine.org
Number theorist Andrew Granville on what mathematics really is - and why objectivity is never quite within reach. |
|
| | | |||
