Explore >> Select a destination
|
You are here 
|
emanueleviola.wordpress.com | ||
| | | | |
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... | |
| | | | |
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... | |
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | A natural transformation is an operation on a category, or more precisely a family of operations, one for each object in the category, which is preserved by morphisms in the category. Each operation in the family is associated with a specific object $latex A$ in the category, which it is said to be on. The... | ||
