Explore >> Select a destination
|
You are here 
|
a3nm.net | ||
| | | | |
windowsontheory.org
|
|
| | | | | (Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms... | |
| | | | |
rjlipton.com
|
|
| | | | | Or rather, what can the shapes of proofs tell us about them? April CACM source Juris Hartmanis did much to lay the landscape of computational complexity beginning in the 1960s. His seminal paper with Richard Stearns, "On the Computational Complexity of Algorithms," was published 50 years ago this month, as observed by Lance Fortnow in... | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | A key theme in real analysis is that of studying general functions $latex {f: X \rightarrow {\bf R}}&fg=000000$ or $latex {f: X \rightarrow {\bf C}}&fg=000000$ by first approximating them b | |
| | | | |
www.theverge.com
|
|
| | | A new report details how OpenAI, Google, and Meta have tried to get over the limits of good data available online - for OpenAI, that includes generating YouTube transcripts. | ||
