Skip Navigation

InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)AI
aio @ aio @awful.systems
Posts
0
Comments
92
Joined
2 yr. ago

America’s premier pronatalists on having ‘tons of kids’ to save the world: ‘There are going to be countries of old people starving to death’

Jump

  • and here i just assumed the name was original to ffxiv

    • The Google AI isn’t hallucinating about glue in pizza, it’s just over indexing an 11 year old Reddit post by a dude named fucksmith.

    Jump

  • no

    • The Google AI isn’t hallucinating about glue in pizza, it’s just over indexing an 11 year old Reddit post by a dude named fucksmith.

    Jump

  • "[massive deficiency] isn't a flaw of the program because it's designed to have that deficiency"

    it is a problem that it plagiarizes, how does saying "it's designed to plagiarize" help????

    • The Google AI isn’t hallucinating about glue in pizza, it’s just over indexing an 11 year old Reddit post by a dude named fucksmith.

    Jump

  • The normal way to reproduce information which can only be found in a specific source would be to cite that source when quoting or paraphrasing it.

    • Remember how ChatGPT totally aced the bar exam? Wow! yeah, turns out that was just a lie

    Jump

    • Jack Dorsey, Bluesky, decentralised social networks and the very common crowd

    Jump

  • nvm i misread

    • Jack Dorsey, Bluesky, decentralised social networks and the very common crowd

    Jump

    • The NixOS community is relitigating quotas, now on Zulip

    Jump

  • What do you mean? Zulip wasn't really a clone of anything originally, it was an attempt to make an application like Zephyr but for web clients, and predates Slack for instance. Unless you're talking about IRC, where I don't think either IRC or Zulip is particularly better or worse than the other.

    • Techdirt: Effective Altruism’s Bait-and-Switch: From Global Poverty To AI Doomerism

    Jump

    • Stubsack: weekly thread for sneers not worth an entire post, week ending Sunday 28 April 2024

    Jump

  • yea i did try to read the lecture notes and got reminded very fast why i don't try to read physics writing lol

    • Stubsack: weekly thread for sneers not worth an entire post, week ending Sunday 28 April 2024

    Jump

  • I think there is in fact a notion of continuous entropy where that is actually true, and it does appear to be used in statistical mechanics (but I am not a physicist). But there are clearly a lot of technical details which have been scrubbed away by the LW treatment.

    • Devin, the obviously fake "AI Developer", turns out to be fake

    Jump

  • the task the AI solves is writing test cases for finding the Least Common Multiple modulo a number.

    Looking at the image of the prompt, it looks more like a CRT computation to me.

    It’s famously much easier to verify modulo arithmetic than it is to actually compute it.

    It's not particularly difficult to compute CRT, though it is definitely trivial to verify the result afterwards. I'm not sure I'd agree that that's a general fact about modular arithmetic computations though.

    • The whole internet loves Kagi, a lovely paid search engine that can find things! 5 seconds later We regret to inform you the CEO is an unhinged narcissist who will harangue you in email

    Jump

  • Simply asking questions would be SAQing off, which is totally different.

    • Building an early warning system for LLM-aided biological threat creation

    Jump

  • The article is very poorly written, but here's an explanation of what they're saying. An "inductive Turing machine" is a Turing machine which is allowed to run forever, but for each cell of the output tape there eventually comes a time after which it never modifies that cell again. We consider the machine's output to be the sequence of eventual limiting values of the cells. Such a machine is strictly more powerful than Turing machines in that it can compute more functions than just recursive ones. In fact it's an easy exercise to show that a function is computable by such a machine iff it is "limit computable", meaning it is the pointwise limit of a sequence of recursive functions. Limit computable functions have been well studied in mainstream computer science, whereas "inductive Turing machines" seem to mostly be used by people who want to have weird pointless arguments about the Church-Turing thesis.