Explore >> Select a destination
|
You are here 
|
gameprogrammingpatterns.com | ||
| | | | |
jeremykun.wordpress.com
|
|
| | | | | This half of the theory of computing primer will cover the various finite automata, including deterministic, nondeterministic, and pushdown automata. We devote the second half [upcoming] entirely to Turing machines and the halting problem, but to facilitate the discussion of Turing machines we rely on the intuition and notation developed here. Defining Computation The first... | |
| | | | |
www.aleksandrhovhannisyan.com
|
|
| | | | | Finite state machines (FSMs) are a useful tool for representing stateful entities in code. In this tutorial, we'll learn how to implement the finite state design pattern in C++. | |
| | | | |
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... | |
| | | | |
xorshammer.com
|
|
| | | There are a number of applications of logic to ordinary mathematics, with the most coming from (I believe) model theory. One of the easiest and most striking that I know is called Ax's Theorem. Ax's Theorem: For all polynomial functions $latex f\colon \mathbb{C}^n\to \mathbb{C}^n$, if $latex f$ is injective, then $latex f$ is surjective. Very... | ||
