Closed marianoguerra closed 3 years ago
🕸 Computing in Hypertext 📝 Lisp: Good News, Bad News, How to Win Big 🎙 Visual programming with Maggie Appleton
🎥 New video about my browser for FoC archives (5 minutes) via Kartik Agaram
You can try it out by downloading two files (and installing Qemu):
Then:
gunzip foc-data-20210814.img.gz
gunzip mu-browser-20210815.img.gz
qemu-system-i386 -m 2G -hda mu-browser-20210815.img -hdb foc-data-20210814.img
🐦 Tweet from @VladyslavSitalo via Vladyslav Sitalo
I’ve been building a way to mix in-observable runtime into Roam (providing an embedded notebook like experience), as a way to make running computation when thinking feel more casual + make it easy to programmatically interact with my notes
🐦 Vlad Sitalo: I've been playing with embedding interactive computation in RoamResearch for a bit and I have some early interesting results to share
An interesting aspect that I’ve added recently is reactive recomputing of the notebook as data in Roam block changes
code: Stvad/iroam
🐦 Vlad Sitalo: … a gist in a gif 🙂
I take it as an axiom that I'm more productive with JSON over XML, and that the shift from XML/WSDL/SOAP APIs to JSON in the 2000's was a great thing and enabled me to be more productive. I am trying to narrow down what the magnitude of the improvement was.
Are JSON vs XML APIs 10% better, 50% better, 200% better, 10x better? Curious if anyone has seen any good numeric takes on that. And also happy to hear from anyone who disagrees with that axiom, but if so please share how much worse you think JSON is, numerically.
My ultimate aim is to try and numerically forecast what the potential gains from the next global notation could be, if any.
Anyone here is interested in SAT, 3-SAT, Complexity, P vs NP? I was looking everywhere for a particular version of 3-SAT algo that I am thinking of (although it is not totally done in my mind) and I would like to understand what am I missing (or not seeing rather) because it does seem to me that there is a nice (i guess) polynomial time (I hope) algo to deal with 3-SAT. Now 3-SAT being NP Complete and the fact that all NP-Complete problems can be reduced to 3-SAT in polynomial time, I am certainly off somewhere. The problem is, I can't figure out where. So was thinking to talk with someone with experience in this area...
📝 Lisp: Good News, Bad News, How to Win Big via Alexander Chichigin
That's a thirty year old (😱) piece and most likely familiar to many members of our community, but it still has some very interesting and relevant insights on design philosophy, programming languages and IDEs. In particular, it introduces a notion of program language as opposed to programming language, a sort of metalanguage.
🎥 Tesla's AI chip (Project Dojo) via Andreas S
When Alan Kay (rightfully so) complained about the lack of innovation in hardware - for PCs… I think he hadn’t seen the progress in this whole AI Chip Industry…
🎙 Visual programming with Maggie Appleton // Metamuse podcast episode 37 via Daniel Garcia
The new episode of the Metamuse podcast with @Maggie Appleton is great, they talk about Visual Programming
[x] Change Month and Week Number
[x] focWeekExport 2021-04-19 2021-04-26
[x] Summary
[ ] Hashtags
[x] Check that comment links work (push weekly dump with channel summaries)
[x] Check to mention right person for moved messages
[x] Update Search Index
[x] Download New Attachments
https://tinyletter.com/
https://tinyletter.com/marianoguerra/letters/
http://localhost:8000/history/
https://marianoguerra.github.io/future-of-coding-weekly/
https://stackedit.io/