Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
pressron.wordpress.com
|
|
| | | | | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... | |
| | | | |
math.andrej.com
|
|
| | | | | [AI summary] The provided text is a collection of comments and discussions from a blog post about the concept of computable functions and their continuity, with a focus on type I and type II computability. The discussion touches on various topics, including the Church-Turing thesis, the role of higher-order functions like m and timeout in different models of computation, and the distinction between constructive and classical mathematics. The comments also explore the implications of different computational models, such as PCF, Turing machines, and Type II computation, and their relevance to real-world applications. The overall theme is the exploration of the boundaries and nuances of computability and continuity in mathematical and computational contexts. | |
| | | | |
nickdrozd.github.io
|
|
| | | | | The goal of the Busy Beaver contest is to find n-state k-color Turing machine programs that run for as long as possible before halting. It's basically an optimization problem: what is the longest finite computation that can squeezed out of a program of a certain length? Or from the flip-side: how much description can be packed into a program of a certain length? | |
| | | | |
www.pcgamer.com
|
|
| | | The latest Mass Effect Andromeda breaking news, comment, reviews and features from the experts at PC Gamer | ||
