/explore
|
You are here 
|
math.andrej.com | ||
| | | | |
www.twanvl.nl
|
|
| | | | | ||
| | | | |
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. |
|
| | | | | ||
| | | | |
scottaaronson.blog
In Michael Sipser's Introduction to the Theory of Computation textbook, he has one Platonically perfect homework exercise, so perfect that I can reconstruct it from memory despite not having opened the book for over a decade. It goes like this: Let f:{0,1}*?{0,1} be the constant 1 function if God exists, or the constant 0 function... |
|
| | | | | ||
| | | | |
qualiacomputing.com
Below I provide a summary of theQuantifying Bliss talk at Consciousness Hacking(video;360 degree live feed record), which took place on June 7th 2017. I am currently working on a longer and more precise treatment of the topic, which I will be posting here as well. That said, since the talk already makes clear, empirically testable... |
|
| | | |||
