Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
accodeing.com
|
|
| | | | | ||
| | | | |
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... | |
| | | | |
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. | |
| | | | |
deniskyashif.com
|
|
| | | In this article, we'll define a basic regular expression language using a context-free grammar and learn how to parse its strings in linear time using the recursive descent method. | ||
