Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
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 | |
| | | | |
www.jeremykun.com
|
|
| | | | | Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility. | |
| | | | |
every.to
|
|
| | | Watch the writer, educator, and podcaster use AI to surface anecdotes, read old books, and understand himself | ||
