Gerald Sussman on Using Languages To Construct Continuous Solutions

This is the next lecture in the series MIT 6.001 Structure and Interpretation (1986). See Hal Abelson on Language Embeddings.

At 5:36 on the problem of integration expressed by rules which increase the complexity of the expression which has to be integrated, see Knuth Bendix Completion.

9:00 On how sums are going to be expressed, ... The A1 and A2 arguments are what in the terminology of yacc are called semantic values. See this message: Infix arithmetic module, so I was only fourteen years behind, ... That's still progress, right? See my reply to Michael Vanier on July 14, 2000.

Is eelectrical engineering the same as mathematical engineering? At 36:40 the representation of arithmetic expressions could be being done as proofs based on axiomatic formulation of arithmetic over some field. Joe Hurd did this for HOL in his PhD thesis, using an interesting representation of exact rational arithmetic using multiples of 2 and 3 which he found in something written by Donald Knuth. Joe's PhD dissertation doesn't even mention this though. The principal result in this work is formal verification of the (stochastic) Miller-Rabin Primality test. See Formal verification of probabilistic algorithms. Note that the existence of such abstraction barriers as Sussman describes means that the applicability of results established in the proof depends crucially on the details such as the procedure by which random numbers are generated. For example, this HOL proof of Joe Hurd's says nothing about the reliability of a Miller-Rabin Primality test based on the Mersenne Twister. See https://gmplib.org/manual/Prime-Testing-Algorithm. Why try a few small factors beforehand?

The full playlist of 20 videos is here: MIT 6.001 Structure and Interpretation, 1986.

Subscribe to MIT Open Courseware.


Comments

Post a Comment

Popular posts from this blog

David Turner Obituary by Sarah Nicholas Fri 24 Nov 2023

Image
This was in The Guardian: David Turner obituary , only eight days after I posted  David Turner Talking About Sixty Years of Functional Programming History : This talk was given in London in 2017: See  Turner, D. A. "Some History of Functional Programming Languages" also  John Hughes - Why Functional Programming Matters  and David MacQueen's talk at ICFP 2015 in  Numberphile - Sophie Maclean on the Catalan Numbers . At 10:30 This whole discussion abut combinator reduction is especially interesting. I didn't know Arthur Norman had tried building hardware for combinator machines. I'll look that up: maybe start here A.C. Norman  Faster combinator reduction using stock hardware  in LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming. At 26:25 on the ISWIM virtual machine implemented in the PAL compacting garbage collector?! This work Reynolds and others did was at MIT in Masecheusetts and Argonne National Laboratory Illinois. Did
Read more

Live Science - Leonardo da Vinci's Ancestry

Image
... and his posterity too? See  On Communication in Linear Time And Hypertext And The Gospel of Sophia . So it looks like El Cielo of the cistine [sic!😂] chapel is not the limit anymore.  I think I just met one of his descendents. A guy called Versailles Toledo who is from Chiapas. That might explain the murals I mention in my recent untitled post , just before the post mentioning this video. I also just took this photo of Rafael Gonzales, born here in Tecate, B.C., who told me about a spring near here called Agua Fría , half way from Tecate to Loma Tova , where, a few decades ago, people used to go to have barbecues and stuff, but now he thinks it may be private land. If someone reading this has a Facebook account, please write a link to this post onto his FB page. To see why I took the photo, look at his T-shirt and the horse-shoes and ponder this: Subscribe to BeatrizER and her video(s?) about mathematical logic, ... Sounds like Edith (II) Rix has been online all the time, ...
Read more