/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. | |
| | | | |
reportofanimals.com
|
|
| | | | | DISCLAIMER: This is an essay I wrote for my Masters degree in 2023, part of a series I will be putting on this site to get me started. While I have changed some of my views and found new lines of inquiry since I wrote this, I feel there is value in it and after... | |
| | | | |
extremal010101.wordpress.com
|
|
| | | With Alexandros Eskenazis we posted a paper on arxiv "Learning low-degree functions from a logarithmic number of random queries" exponentially improving randomized query complexity for low degree functions. Perhaps a very basic question one asks in learning theory is as follows: there is an unknown function $latex f : \{-1,1\}^{n} \to \mathbb{R}$, and we are... | ||
