/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 jeremykun.wordpress.com
Determinism and Finite Automata - A Primer - Math Programming
| | accodeing.com
Duty calls - CSS3 is NOT proven to be turing complete!, Accodeing to you
3.8 parsecs away

Travel
| | [AI summary] The article discusses the debate around whether CSS3 is Turing complete, focusing on Eli Fox-Epstein's implementation of a Rule 110 automaton using CSS and HTML. It explains the theoretical concepts of Turing completeness, the limitations of real-world implementations, and the implications of such a claim. The author concludes that CSS appears to be Turing complete, though the discussion highlights the complexities and controversies surrounding this assertion.
| | rjlipton.com
Proving Cook's Theorem | Gödel's Lost Letter and P=NP
3.5 parsecs away

Travel
| | 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...
| | deniskyashif.com
Implementing a Regular Expression Engine · Denis Kyashif's Blog
2.9 parsecs away

Travel
| | In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm.
| | algobeans.com
Convolutional Neural Networks (CNN) Introduction - Algobeans
23.1 parsecs away

Travel
| While an artificial neural network could learn to recognize a cat on the left, it would not recognize the same cat if it appeared on the right. To solve this problem, we introduce convolutional neural networks.