/explore
|
You are here 
|
blog.sigfpe.com | ||
| | | | |
math.andrej.com
|
|
| | | | | [AI summary] The provided text is a collection of comments and discussions from a blog post about the concept of computable functions and their continuity, with a focus on type I and type II computability. The discussion touches on various topics, including the Church-Turing thesis, the role of higher-order functions like m and timeout in different models of computation, and the distinction between constructive and classical mathematics. The comments also explore the implications of different computational models, such as PCF, Turing machines, and Type II computation, and their relevance to real-world applications. The overall theme is the exploration of the boundaries and nuances of computability and continuity in mathematical and computational contexts. | |
| | | | |
jdh.hamkins.org
|
|
| | | | | I have been reading Alan Turing's paper, On computable numbers, with an application to the entsheidungsproblem, an amazing classic, written by Turing while he was a student in Cambridge. This... | |
| | | | |
micromath.wordpress.com
|
|
| | | | | Continuing the theme of alternative approaches to teaching calculus, I take the liberty of posting a letter sent by Donald Knuth to to the Notices of the American Mathematical Society in March, 1998 (TeX file). Professor Anthony W. Knapp P O Box 333 East Setauket, NY 11733 Dear editor, I am pleased to see so... | |
| | | | |
andreabergia.com
|
|
| | | I usually write parsers by starting from a grammar and either coding a lexer/parser by hand or relying on tools such as the fantastic Antlr. However, a friend recently introduced me to parser combinators, which I found to be very interesting and useful. It's not a recent idea, but it was new to me, and I have found it to be very interesting and useful. | ||
