Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
www.forwardscattering.org
|
|
| | | | | [AI summary] Nicholas Chapman proves that it is decidable to find the fastest Turing machine for computing functions defined on a finite domain by limiting the search space to machines with a finite number of states based on a reference solution's runtime. | |
| | | | |
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. | |
| | | | |
www.sligocki.com
|
|
| | | | | A few weeks ago, I announced new Beeping Busy Beaver results. In this post, I'd like to explain a little bit about the process I'm using to do this search. I'm following roughly the same process that has been used to exhaustively search for standard Busy Beavers (see ex: Marxen and Buntrock, Attacking the Busy Beaver 5) in the past with a few tweaks for the Beeping halt condition. | |
| | | | |
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... | ||
