mastodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance, open to everyone, but mainly English and French speaking.

Administered by:

Server stats:

856
active users

#sicp

0 posts0 participants0 posts today
Hacker News<p>Solving SICP — <a href="https://lockywolf.wordpress.com/2021/02/08/solving-sicp/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">lockywolf.wordpress.com/2021/0</span><span class="invisible">2/08/solving-sicp/</span></a><br><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/SolvingSICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SolvingSICP</span></a> <a href="https://mastodon.social/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> <a href="https://mastodon.social/tags/Programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Programming</span></a> <a href="https://mastodon.social/tags/Lisp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Lisp</span></a> <a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>HackerNews</span></a> <a href="https://mastodon.social/tags/Education" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Education</span></a></p>
gosha<p>Love me some computer science with my morning natto. <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.17 done.</p>
gosha<p>Finished <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.16, took me a couple of weeks I feel? I initially felt really stuck, but being patient and making sure I understand each word has helped, to the point that I was able to reason about it without having the book in front of me, while driving or doing chores. Very cool!</p>
gosha<p>Finished <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.14 🤘</p>
Kompot<p><strong>Kompotov Programerski Bralni Krožek #23</strong></p> March 27, 2025, 6:45:00 PM CET - GMT+1 - Centralna tehniška knjižnica, 1000, Ljubljana, Slovenia <p><a href="https://dogodki.kompot.si/events/48a0ba15-7600-4af9-a235-66a69a0a0e6f" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dogodki.kompot.si/events/48a0b</span><span class="invisible">a15-7600-4af9-a235-66a69a0a0e6f</span></a></p>
Kompot<p><strong>Kompotov Programerski Bralni Krožek #22</strong></p> March 13, 2025, 6:45:00 PM CET - GMT+1 - Centralna tehniška knjižnica, 1000, Ljubljana, Slovenia <p><a href="https://dogodki.kompot.si/events/85907482-ebad-4f5d-8eef-d5d736ed405d" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dogodki.kompot.si/events/85907</span><span class="invisible">482-ebad-4f5d-8eef-d5d736ed405d</span></a></p>
Kompot<p><strong>Kompotov Programerski Bralni Krožek #21</strong></p> February 27, 2025, 6:45:00 PM CET - GMT+1 - Centralna tehniška knjižnica, 1000, Ljubljana, Slovenia <p><a href="https://dogodki.kompot.si/events/08399f25-9f96-42d9-bcc0-823fea380611" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dogodki.kompot.si/events/08399</span><span class="invisible">f25-9f96-42d9-bcc0-823fea380611</span></a></p>
Kompot<p><strong>Kompotov Programerski Bralni Krožek #20</strong></p> February 13, 2025, 6:45:00 PM CET - GMT+1 - Centralna tehniška knjižnica, 1000, Ljubljana, Slovenia <p><a href="https://dogodki.kompot.si/events/1fe6f607-d3e2-42bc-be86-ae2174e620cc" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">dogodki.kompot.si/events/1fe6f</span><span class="invisible">607-d3e2-42bc-be86-ae2174e620cc</span></a></p>
gosha<p>Done with <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.13. Another hard one for me, this was way more math than I've done at any point since high school. Wouldn't have managed without outside help!</p>
Kerrick Long (code)<p><a href="https://ruby.social/tags/Ruby" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Ruby</span></a> code-along with the <a href="https://ruby.social/tags/JavaScript" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>JavaScript</span></a> edition of The Structure and Interpretation of Computer Programs be like...</p><p><a href="https://ruby.social/tags/Programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Programming</span></a> <a href="https://ruby.social/tags/JS" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>JS</span></a> <a href="https://ruby.social/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> <a href="https://ruby.social/tags/StabbyLambda" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>StabbyLambda</span></a> <a href="https://ruby.social/tags/CallShorthand" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>CallShorthand</span></a> <a href="https://ruby.social/tags/ThisIsSuchNonIdiomaticRuby" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ThisIsSuchNonIdiomaticRuby</span></a> <a href="https://ruby.social/tags/IWishRubyHadTailCallOptimization" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>IWishRubyHadTailCallOptimization</span></a> <a href="https://ruby.social/tags/LuckilyTheMaximumStackSizeHasNotYetBeenExceeded" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LuckilyTheMaximumStackSizeHasNotYetBeenExceeded</span></a></p>
gosha<p>I've been able to have a consistent early morning routine for the past few days with studying <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> and writing code for my project, and that feels really great. I really hope I can keep it up, because it really energises me for the rest of my day!</p>
gosha<p>Fuckin' 'ell, finally finished <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.11. That iterative process bit was super tough for me.</p>
gosha<p>The <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> example of counting change (page 51 of the PDF) is kicking my butt, ha. It took me a really long time to understand that "using all n kinds of coins" means "you can choose freely from all the n available types of coins but don't need to use all of them". And now, as a challenge, I'm trying to come up with an iterative process to solve this and I'm really struggling!</p><p>No one said that studying computer science at 42yo would be easy 😌</p>
gosha<p>It took me a long while but I finally wrapped my head around <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.7! Gonna pat myself on the back, it wasn’t easy for me :blobpats:</p>
gosha<p>I wrote a post about how to set up your Doom Emacs (on a Mac) to study <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a>. <a href="https://gosha.net/2025/sicp-emacs/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">gosha.net/2025/sicp-emacs/</span><span class="invisible"></span></a></p>
gosha<p>That child-like delight when I figured out <a href="https://merveilles.town/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> exercise 1.6, haha. I love this very much.</p>
HoldMyType<p>```<br>(use-package ob-racket<br> :after org<br> :pin manual<br> :config<br> (append '((racket . t) (scribble . t)) org-babel-load-languages))<br>)<br>```<br><a href="https://mathstodon.xyz/tags/sicp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>sicp</span></a></p>
DJ Adams<p>For you lovely folks there on the intersection between CAP practicalities, combined with the Art &amp; Science of CAP, and some fundamental ideas on which it is based, including many from functional programming, a short post: "Functions as first class citizens in SICP Lecture 1A" - share &amp; enjoy! <a href="https://qmacro.org/blog/posts/2024/12/16/functions-as-first-class-citizens-in-sicp-lecture-1a/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">qmacro.org/blog/posts/2024/12/</span><span class="invisible">16/functions-as-first-class-citizens-in-sicp-lecture-1a/</span></a></p><p><a href="https://hachyderm.io/tags/SAPCAP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SAPCAP</span></a> <a href="https://hachyderm.io/tags/FP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FP</span></a> <a href="https://hachyderm.io/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> <span class="h-card" translate="no"><a href="https://a.gup.pe/u/sap" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>sap</span></a></span></p>
DJ Adams<p>Short post: Evening thoughts on CDL in the context of SICP's pre-amble for the intro to Scheme: <a href="https://qmacro.org/blog/posts/2024/12/09/the-elements-of-programming-with-respect-to-cdl-and-sicp/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">qmacro.org/blog/posts/2024/12/</span><span class="invisible">09/the-elements-of-programming-with-respect-to-cdl-and-sicp/</span></a> @sap <a href="https://hachyderm.io/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> <a href="https://hachyderm.io/tags/SAPCAP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SAPCAP</span></a></p>
Pango<p><span class="h-card" translate="no"><a href="https://framapiaf.org/@jeeynet" class="u-url mention" rel="nofollow noopener noreferrer" target="_blank">@<span>jeeynet</span></a></span> <br><a href="https://tooter.social/tags/Page42" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Page42</span></a> <br>"Cet algorithme est connu sous le nom de test de Fermat."<br>Structure et Interprétation des programmes informatiques <a href="https://tooter.social/tags/SICP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SICP</span></a> </p><p>Règles du jeu :<br>- Prenez le livre le plus proche.<br>- Ouvrez-le à la page 42<br>- Trouvez la 2ème phrase<br>- Publiez la phrase dans un toot avec le hashtag et écrivez les règles en commentaire<br>- Ne cherchez pas votre livre préféré, le plus cool ou le plus spirituel. Optez pour le plus proche.</p>