/explore
|
You are here 
|
scottaaronson.blog | ||
| | | | |
bartoszmilewski.com
|
|
| | | | | This is part of the book Category Theory for Programmers. The previous instalment was Category: The Essence of Composition. See the Table of Contents. The category of types and functions plays an important role in programming, so let's talk about what types are and why we need them. Who Needs Types? There seems to be... | |
| | | | |
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. | |
| | | | |
rjlipton.com
|
|
| | | | | 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... | |
| | | | |
kwoted.wordpress.com
|
|
| | | https://wtfwheresthefaith.com/2024/08/13/summer-reads-week-six-bookworms-sign-off-for-now/comment-page-1/#respond?page_id=7010 | ||
