|
You are here |
xorshammer.com | ||
| | | | |
jeremykun.wordpress.com
|
|
| | | | | We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... | |
| | | | |
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... | |
| | | | |
nickdrozd.github.io
|
|
| | | | | The classic Busy Beaver function is defined as the maximum number of steps that an N-state 2-color Turing machine program can run before halting when started on the blank tape. The function is uncomputable, and any sound proof system S can only prove values up to a certain point. That is, there is some number Q such that | |
| | | | |
blog.sigfpe.com
|
|
| | | [AI summary] The post explores the challenges and counterintuitive results of implementing exact real arithmetic on computers, focusing on representation, computability, and the connection between topology and continuity. | ||