/explore
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
jeremykun.wordpress.com
|
|
| | | | | We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... | |
| | | | |
scottaaronson.blog
|
|
| | | | | For the past few days, I was bummed about the sooner-than-expected loss of Steven Weinberg. Even after putting up my post, I spent hours just watching old interviews with Steve on YouTube and reading his old essays for gems of insight that I'd missed. (Someday, I'll tackle Steve's celebrated quantum field theory and general relativity... | |
| | | | |
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. | |
| | | | |
xorshammer.com
|
|
| | | Nonstandard Analysis is usually used to introduce infinitesimals into the real numbers in an attempt to make arguments in analysis more intuitive. The idea is that you construct a superset $latex \mathbb{R}^*$ which contains the reals and also some infinitesimals, prove that some statement holds of $latex \mathbb{R}^*$, and then use a general "transfer principle"... | ||
