Explore >> Select a destination
|
You are here 
|
blog.paulhankin.net | ||
| | | | |
www.yodaiken.com
|
|
| | | | | ||
| | | | |
theartofmachinery.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. | |
| | | | |
www.superpath.co
|
|
| | | John Bonini is a T-shaped marketer with a wealth of experience. In this episode, we talk about his career, side projects and his latest venture. | ||
