Explore >> Select a destination
|
You are here 
|
gowers.wordpress.com | ||
| | | | |
adam.chlipala.net
|
|
| | | | | [AI summary] This text provides an in-depth exploration of advanced Coq proof techniques, focusing on manual proofs, recursion, and induction principles for complex data structures. It covers topics like nested inductive types, custom induction principles, and the design philosophy behind Coq's approach to proof automation. The text includes detailed examples of proof scripts, such as manual proofs for discrimination and injectivity of constructors, and discusses the use of tactics like discriminate and injection. It also touches on the implementation of functions like pred and the role of hints in improving proof readability and automation. | |
| | | | |
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. | |
| | | | |
ianwrightsite.wordpress.com
|
|
| | | | | Are Cantor's higher infinities really real? | |
| | | | |
scottaaronson.blog
|
|
| | | Unrelated Announcement: The Call for Papers for the 2024 Conference on Computational Complexity is now out! Submission deadline is Friday February 16. Every month or so, someone asks my opinion on the simulation hypothesis. Every month I give some variant on the same answer: As long as it remains a metaphysical question, with no empirical... | ||
