/explore
|
You are here 
|
rjlipton.com | ||
| | | | |
accodeing.com
|
|
| | | | | [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. | |
| | | | |
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... | |
| | | | |
inquiryintoinquiry.com
|
|
| | | | | Re: R.J. Lipton and K.W. Regan Proving Cook's Theorem Synchronicity Rules? I just started reworking an old exposition of mine on Cook's Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it into the cactus graph syntax for propositional calculus I developed as an extension of Peirce's... | |
| | | | |
4gravitons.com
|
|
| | | Merging quantum mechanics and gravity is a famously hard physics problem. Explaining why merging quantum mechanics and gravity is hard is, in turn, a very hard science communication problem. The more popular descriptions tend to lead to misunderstandings, and I've posted many times over the years to chip away at those misunderstandings. Merging quantum mechanics... | ||
