Explore >> Select a destination
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
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. | |
| | | | |
gavinhoward.com
|
|
| | | | | I have found a lot of programmers that do not understand the Halting Problem and its implications, so here is my attempt to fix that. | |
| | | | |
www.jeremykun.com
|
|
| | | | | The first step in studying the sorts of possible computations (and more interestingly, those things which cannot be computed) is to define exactly what we mean by a "computation." At a high level, this is easy: a computation is simply a function. Given some input, produce the appropriate output. Unfortunately this is much too general. For instance, we could define almost anything we want in terms of functions. Let $ f$ be the function which accepts as input the date of California Super Lotto drawings, an... | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | To get a sense of how LaTeX2WP works, and of what is still missing, here is the unedited output of the program given the latex source of my Max Cut paper (the most recent arxiv submission). Note that the \ref commands have become clickable links. You can see that footnotes and bibliography are not supported.... | ||
