/explore
|
You are here 
|
inquiryintoinquiry.com | ||
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... | |
| | | | |
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. | |
| | | | |
the520chaincafe.blogspot.com
|
|
| | | | | [AI summary] A Yamaha YDS2 blog post, though the actual content is absent and the text is composed entirely of blog archive navigation elements and timestamps. | |
| | | | |
nickdrozd.github.io
|
|
| | | How long can a Turing machine program run when started on the blank tape before the tape becomes blank again? Of course, this will depend on the length of the program - how many states and colors it has. Even given these parameters, it is logically impossible to calculate how long a self-cleaning Turing machine can run. Any values that can be known have to be discovered empirically. | ||
