"It's hard to avoid thoughts of violence when I see something like this" has to be the best line in the entire slide deck and is something we can probably all relate to 😂
Great to mention the philosophical stuff and the fun. I thought I'm just the unworldly freak, who sees philosophical problems, when coding. Seeing Sussman talking about this, and also explaining the type-errors of math (which you can also find in Linear Algebra, even in some so called proofs), was really relief for me. When even the math profs tell you BS, and you think you maybe are just too stupid (imposter?), and then comes along Sussman and says: Well, yes, the math teaching is crap! 🙂 Sussman, a great personality! His rants are exhilarant. And... the free software thing at the end of the talk was quite unexpected. Great, he mentioned it!
Well, then you can stop abusing the poor ZFC and join the glorious Type-theoretic family. It turns out that I actually learned how to do formal induction(i.e. proof) from Sussman's 1986 lecture videos where he taught me how to use fixed points to express infinite admissibilty using finite expression, but Sussman himself seems stuck to Mathematics of Riemann's era if not Gauss's era, 2 centuries ago, and is totally innocent to the development of modern mathematics of Grothendieck's algebraic geometry, or categorical universal algebra, not to mention the lesser known constructive line of Kolmogorov, Brouwer, Church, Turing, and all the way to MLTT/HoTT. No you can't stablize Gauss's infinite infinity with a Turing machine, you can't even do the marginal combinatorial enumeration cases. What you need to do is to find the finite recursive generator to prove the finte number of properties you need in the context of infinite possibility, and this is the best judgement you can possibly make.
I try and dynamically respond to as many as a I can. I regretfully inform those whom I cannot dynamically respond to, that in the future there would be more response of the dynamic nature. Ohhhyouuuuu oboy!
31:53 I'm not sure what Sussman is proposing for the behavior of the set constructor If it behaved differently for set arguments, that would be less consistent His point stands, but it's an odd example
he wants the arguments to be the items: set('foo', 'bar') => {'foo', 'bar'}. I'll point out that dict(foo=5, bar=3) does the right thing. For set arguments it would be a set of sets: set({'foo'}) => {{'foo'}}.
Free software is very laudable, but only an academic with a guaranteed salary could be this purist about it. Regretfully until we reach the post scarcity society, some people will still need to earn their living by selling their creativity even though I admit that is a bit sordid. 🙂
@@pragmaticmero686 Use AGPL because GPL is effectively like BSD or MIT in a world of software as a service. You are not compelled to release GPL software running on your servers, but must release AGPL software running on your server.
"It's hard to avoid thoughts of violence when I see something like this" has to be the best line in the entire slide deck and is something we can probably all relate to 😂
Emotional Damage
Deeply inspiring. Makes me want to watch the 6.001 lessons again
Fascinated with a sharpness of your mind and your joy of programming
04:52 "That is the job of compilers."
Brilliant!
Lots of great stuff here but I love the dual numbers at 38:00. Seems like they might have an application to control systems.
Mind blowing! What a brilliant human being
I wish we had the Q&A !
Great to mention the philosophical stuff and the fun.
I thought I'm just the unworldly freak, who sees philosophical problems, when coding.
Seeing Sussman talking about this, and also explaining the type-errors of math (which you can also find in Linear Algebra, even in some so called proofs), was really relief for me.
When even the math profs tell you BS, and you think you maybe are just too stupid (imposter?), and then comes along Sussman and says: Well, yes, the math teaching is crap! 🙂
Sussman, a great personality!
His rants are exhilarant.
And... the free software thing at the end of the talk was quite unexpected.
Great, he mentioned it!
Sussman hahahahahah sussman sussy baka hahahah sussy sussy brainrot sus amogus sussy dude
Well, then you can stop abusing the poor ZFC and join the glorious Type-theoretic family. It turns out that I actually learned how to do formal induction(i.e. proof) from Sussman's 1986 lecture videos where he taught me how to use fixed points to express infinite admissibilty using finite expression, but Sussman himself seems stuck to Mathematics of Riemann's era if not Gauss's era, 2 centuries ago, and is totally innocent to the development of modern mathematics of Grothendieck's algebraic geometry, or categorical universal algebra, not to mention the lesser known constructive line of Kolmogorov, Brouwer, Church, Turing, and all the way to MLTT/HoTT. No you can't stablize Gauss's infinite infinity with a Turing machine, you can't even do the marginal combinatorial enumeration cases. What you need to do is to find the finite recursive generator to prove the finte number of properties you need in the context of infinite possibility, and this is the best judgement you can possibly make.
but linked lists _must_ be real. how else do we explain TH-cam comments not having a tree structure
Beautiful, is there a link to the presentation slides?
I try and dynamically respond to as many as a I can. I regretfully inform those whom I cannot dynamically respond to, that in the future there would be more response of the dynamic nature. Ohhhyouuuuu oboy!
31:53 I'm not sure what Sussman is proposing for the behavior of the set constructor
If it behaved differently for set arguments, that would be less consistent
His point stands, but it's an odd example
he wants the arguments to be the items: set('foo', 'bar') => {'foo', 'bar'}. I'll point out that dict(foo=5, bar=3) does the right thing. For set arguments it would be a set of sets: set({'foo'}) => {{'foo'}}.
Scheme programming should be defun! * flame war follows *
How do You Make Games in Scheme Programming Language?
For example with Guile Chickadee - search for it.
There are languages called Fennel and Urn that compile to Lua, And Lua is used a ton in games.
Have you heard of the Itch Lisp Game Jam? The spring lisp game jam is running now! I am using Guile Hoot.
The folks at Bit Twiddle Games made a scheme based game. I didn't know if any of it is open source yet though.
@@cyancaelus6456 Guile Hoot compiles into webassembly. Cheekadee will support that in the future.
GJS is a Great Explainer
You are my idol. Hi5 dear fellow Aquarius 🖖
Free software is very laudable, but only an academic with a guaranteed salary could be this purist about it. Regretfully until we reach the post scarcity society, some people will still need to earn their living by selling their creativity even though I admit that is a bit sordid. 🙂
Free as in freedom, not necessarily gratis. These days you have tons of company making a living through foss, even when the code is gratis.
How and by who do you think GNU/linux is developed ?
We need more GPL and less MIT or BSD, gpl+dual_Licensing is the only way that today we could ensure a good future for open source
@@pragmaticmero686 Use AGPL because GPL is effectively like BSD or MIT in a world of software as a service. You are not compelled to release GPL software running on your servers, but must release AGPL software running on your server.
@@Jamey_ETHZurich_TUe_RulezKafka never got a cent from me.
Suss man? Omg sussy baka
@33:35 what? I see no problem