/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 www.jeremykun.com
P vs. NP, A Primer (And a Proof Written in Racket) | Math Programming
| | rjlipton.com
Proving Cook's Theorem | Gödel's Lost Letter and P=NP
2.8 parsecs away

Travel
| | 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...
| | a3nm.net
List of open questions
2.5 parsecs away

Travel
| | List of open questions
| | windowsontheory.org
Structure vs. Combinatorics in Computational Complexity - Windows On Theory
2.9 parsecs away

Travel
| | (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...
| | sophiabits.com
Do you need an LLM for that? | Sophia Willows
20.7 parsecs away

Travel
| [AI summary] The article argues that Large Language Models are best suited for generative tasks like creating content, but traditional supervised learning methods are superior for non-generative tasks such as classification and named entity recognition due to better accuracy, lower latency, and reduced costs.