• 0 Posts
  • 6 Comments
Joined 5 months ago
cake
Cake day: July 8th, 2024

help-circle


  • Dan asked me “what’s the fastest Big O notation?” and hey, to my credit despite not having a college degree, I knew the answer from self studying! “Oh, I know this. O(1) Constant time”, I said over the phone. “No, see it’s O(0). The fastest program is the one that never runs. It’s clear you don’t have enough experience for this role. So let’s test you on your sysadmin capabilities. Maybe you can redeem yourself there”.

    There is something about the simultaneous pedantry and total ignorance in this that is enraging. Everything is O(1) space because there are 1081 atoms in the universe, and everything is O(1) time because of the heat death of the universe, don’tcha know. Also did I just solve the halting problem?




  • There’s vanishly little that LLMs are actually being used for that can’t be done far cheaper (computatiomally and cost-wise) with existing tools.

    Reminds me of the most recent Adam Conover podcast. He had as guests two computer scientists who were purportedly critical of AI, and one of them still shat out something to the effect of:

    It does have a use case where something takes longer to produce than it does to verify. For example, a website …