Explore >> Select a destination
|
You are here 
|
www.yodaiken.com | ||
| | | | |
scilogs.spektrum.de
|
|
| | | | | The eerily prescient thoughts of Alan Turing, the visionary who laid the foundations of computer science, remain remarkably relevant to today's discussions concerning AI. Read more | |
| | | | |
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. | |
| | | | |
lukebechtel.com
|
|
| | | | | There are N + 1 hard things in computer science | |
| | | | |
ncatlab.org
|
|
| | | |||
