/explore
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
eklausmeier.goip.de
|
|
| | | | | [AI summary] This article explains the mathematical method of diagonalization, using Cantor's proof of uncountability and Turing's halting problem as primary examples. | |
| | | | |
www.forwardscattering.org
|
|
| | | | | [AI summary] Nicholas Chapman proves that it is decidable to find the fastest Turing machine for computing functions defined on a finite domain by limiting the search space to machines with a finite number of states based on a reference solution's runtime. | |
| | | | |
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. | |
| | | | |
scottaaronson.blog
|
|
| | | So, Part II of my two-part series for American Scientist magazine about how to recognize random numbers is now out. This part---whose original title was the one above, but was changed to "Quantum Randomness" to fit the allotted space---is all about quantum mechanics and the Bell inequality, and their use in generating "Einstein-certified random numbers." | ||
