Omar Antolín

Now entering the age of the secrecy. 🙁

«Amid the rise of artificial intelligence, technophobes and Luddites have continued to insist that machines “can’t really write”—at least not the way humans can. Those naysayers will be hard-pressed to wave away The Great Gatsby, the debut novel from the super-advanced Xerox 914 photocopier—an exciting new voice that wrote Gatsby after being trained on a data set comprising a paperback copy of F. Scott Fitzgerald’s The Great Gatsby.» https://www.mcsweeneys.net/articles/book-review-the-great-gatsby-by-the-xerox-914-photocopier

@MostlyHarmless@thecanadian.social there's an obvious experiment to try: take half of the people that you suspect this about and teach them how to podcast.

It's funny how math works sometimes. I just finished reading a master's thesis, and in the final chapter practically every result claimed was false! But if you added four words to one definition at the beginning of the chapter, and removed one character from another, magically all the results become correct without modifying them.

After a recent post by @chiply@fosstodon.org on r/emacs, I decided to give Hyperbole another shot. I installed it and it stole some some important key bindings including M-o which I use for other-window. I still want to give it a shot, but now I need to install it again because my body rejected it: I uninstalled it on autopilot so quickly I didn't have time to think "It's OK, I still want to try it, I'm sure I can change the key bindings". By the time that thought was finished the mode was deactivated and the package deleted! 😅 In this case it wasn't what I wanted, but it's good to know my #Emacs instincts kick in quickly to protect me from Emacs dangers. EDIT: Surely hyperbole-mode being activated upon *instalation* counts as a bug? EDIT 2: Wow! It clobbers the global binding for C-h h! Even if you turn hyperbole-mode off you still loose your binding for C-h h. 😱

@MartinEscardo@mathstodon.xyz "I was accused by some peers of dismissing this, and, at the same time, attacked by other peers for even considering it as a possibility." Very common experience in recent times. 😅

@gregeganSF@mathstodon.xyz Claude Fable generated text indicating surprise too: https://cdn.xcancel.com/pic/orig/EA1E99C3DAE99/media%2FHNpQXPsWoAAvXPH.png https://cdn.xcancel.com/pic/orig/3B5C0B867A7C3/media%2FHNpQUaiWsAA43GQ.png

@gregeganSF@mathstodon.xyz Surprisingly low degree, right? Wow.

@mekkaokereke@hachyderm.io You're missing an a, it's "blanqueamiento".

@grammargirl@zirk.us ▶️

@julesh@mathstodon.xyz By the Yoneda lemma, if F is represented by some set A, then Nat(F, id) = id(A) = A. That's probably the easiest way to recover the representing object.

@andrejbauer I think you might be making some kind of joke that went over my head, but just in case you meant it literally, that is very famously not how Facebook started! Facebook started as a website for male Harvard students to rate the physical attractiveness their female classmates. @jonmsterling

@boarders@mathstodon.xyz @byorgey@mathstodon.xyz hahaha! I was wondering what the uniqueness part of the fundamental theorem of algebra was, arithmetic indeed makes more sense!

@byorgey@mathstodon.xyz Maybe I've spent too much time with array languages, but I'd write this function as: conjugatePartition p = foldr1 (zipWith (+)) [[fromEnum(k<=x)| k <- [1..head p]] | x <- p] Or, in various array languages: APL: {+⌿⍵∘.≥⍳⊃⍵} BQN: +˝>⌜⟜(↕⊑) J: +/@(>/ i.@{.) k: {+/x>\:!*x}

@MartinEscardo@mathstodon.xyz Your findings seem similar to those of this paper that analyzed the dependency graph of mathlib: https://arxiv.org/abs/2604.24797 The abstract says: "taxonomies designed by humans diverge from logical structures, exhibiting a 50.9% coupling across namespaces"

@jonmsterling@mathstodon.xyz You probably missed it because you blocked him 😛, but Tao wrote about this recently: https://mathstodon.xyz/@tao/116477351524980995

@jonmsterling I bet you chose the double negation in "Univalence isn't non-useful for classical mathematics" so the sentence is valid constructively, but I, as a classical mathematician, will simplify it to "univalence is useful in classical mathematics". 😛

@jameshowell@fediscience.org I'm currently listening to the previous post in the series¹ and agreeing with pretty much everything. ¹ https://www.chiply.dev/post-icr-primer @minad@mastodon.world

@jaror@social.edu.nl This building houses the math department at the University of Stockholm, so I guess math in Swedish is "Patologisk Anatomi Bakteriologi". 😛 @helge@mastodon.social @jonmsterling@mathstodon.xyz @de_Jong_Tom@mathstodon.xyz @ionica@mathstodon.xyz

@chiply@fosstodon.org @jameshowell@fediscience.org @minad@mastodon.world I've now read the article and enjoyed it a lot! It contains a clear explanation of the division of labor of the various packages, and I'll definitely point people to it in the future. I also agree with its comments on Helm and Ivy/Swiper/Counsel (both of which I used extensively in the past and like a lot). One thing I don't think was mentioned about Embark is that you can use any existing Emacs command as an action. It bothered me that I needed to write trivial wrappers for commands if I wanted to use them as actions in Helm or Ivy, and that you needed the foresight to pre-register the wrapper as an action before you needed it. With embark pre-registering is never required and most of the time neither is any wrapper or glue code. Finally, I'd like to point out the history in the article omits Drew Adams's Icicles which is from like 2006 and has a lot of this functionality! Unlike Helm and Ivy, I don't think it was a big influence on my or Daniel's packages since neither of us has used it (we mostly found out after the fact from Drew's comments on reddit that over a decade earlier Icycles already had some feature we had just implemented).

@minad@mastodon.world Now that I've gotten used to corfu instead of consult-completion-in-region, I should probably switch to cape-history in REPLs and shells. For minibuffer history, I might stick with consult-history. Which do you use for minibuffer history, Daniel? @tchauhan@mastodon.mit.edu @jameshowell@fediscience.org

@mjd@mathstodon.xyz you know, it's very likely that you can just show up and attend any talks you want. I've never seen a math conference that, you know, checks registration to let you into the talks. Of course, I've also never been to the ICM, but I have attended regional AMS conferences and once the Joint Mathematical Meeting. I thought the registration fee was a little steep for a graduate student (specially one stretching the stipend to a family of three!) and didn't pay it. Nobody gave me any trouble.

@davidgerard@circumstances.run That sells them short! You can also use them as solutions that don't work for problems you *do* have!

@byorgey@mathstodon.xyz Another approach is to use binary search on each integer from 1 to maximum p to find between which two indices of p it would go. Depending on whether binary search favors the lower or upper value, that can directly give you the conjugate and is O(maximum p * log length p). In J that would be I.i.@{. @das_g@chaos.social

@arsatiki@wandering.shop I don't find that surprising. Americans dislike electric cars for the most part and Americans who do want an electric car can't buy the affordable Chinese ones. @johncarlosbaez@mathstodon.xyz

@byorgey@mathstodon.xyz I initially thought you were pulling an xkcd 641.

@plexus @sacha gave a talk in EmacscConf about the process of organizing EmacsConf, https://emacsconf.org/2023/talks/emacsconf/ And I think she might have also written more detail about parts of this on her blog.

@masukomi There's a good way to do it!? In Mexico we must have copied the US way (as we very often do), because they suck here too.

@geomannie@mastodon.scot I have a friend who worked for a while as a bartender and was the only one at her work place who knew how to calculate the pre-tax price. She was a math major in university, and it's very sad that that is seemingly what it takes! (This was in Mexico, not the UK — I guess math is badly taught in many countries). @kityates@mas.to

@minad@mastodon.world Same here, except I use M-h (not a lot paragraphs to mark in that type of buffer). @tchauhan@mastodon.mit.edu @jameshowell@fediscience.org

@kickingvegas@sfba.social I thought IMEs were mechanisms to type single characters and that most of them do not involve incremental completion and filtering! EDIT: Your Wikipedia link agrees with my recollection. @jameshowell@fediscience.org @minad@mastodon.world

@jamie I saw a clip of Margot Robbie explaining the Australian saying "we're not here to fuck spiders". @Migueldeicaza

@ddrake@mathstodon.xyz Isn't ethics considered completely irrelevant for software design nowadays? 🙁

@mms@mastodon.bsd.cafe WOAH!

@jer_gib@functional.cafe Does this version really have complexity O(length ns + maximum ns)? The minimum of ns is the last element which takes linear time for linked lists. So I think this is (length ns) * maximum ns, but you could make it run in the desired time by using arrays instead of lists. Am I missing something? @byorgey@mathstodon.xyz @das_g@chaos.social

@byorgey@mathstodon.xyz That's right! I had missed that. I'd insist on reversing since it seems weird to take the input sorted one way and return the result sorted the other way, though. @das_g@chaos.social

@amy Is this a LaTeX joke or did I not get it?

@byorgey@mathstodon.xyz I used to think Haskell was concise...

@mjd@mathstodon.xyz OK. I didn't mean to bother you by insisting. I'm sorry.

@nosrednayduj@hachyderm.io On my instance, the trending tab is always empty, which maybe is just true. It's an instance for mathematicians, maybe just nothing ever trends. @lisamelton@mastodon.social

@byorgey@mathstodon.xyz Wow! That's surprising and troubling.

@timbray@cosocial.ca i've never seen a post that I believe is LLM generated without this being disclosed. I do sometimes see LLM generated text being quoted, identified as such, and with some human commentary. EDIT: I was only thinking of text. I do see generated images in blog post thumbnails a little more often.

@masukomi It's a shame you've forgotten, I was going to ask how they could possibly be good. 😅 @demi

@mjd@mathstodon.xyz I don't think most mathematicians would find it underhanded. One of our main problems is getting anybody, even other mathematicians, to care about what we do! So I don't think anybody would want to turn you away. I'd say that in general mathematicians always welcome anybody to read their papers or attend their courses or listen to their talks, anything like that.

@jameshowell@fediscience.org How is this different from using Emacs's built-in backup system¹ configuring backup-enable-predicate to check for membership in your list of precious files (and configuring backup-directory-alist to put the backups wherever you want them)?

¹ See https://www.gnu.org/software/emacs/manual/html_node/emacs/Backup.html and https://www.gnu.org/software/emacs/manual/html_node/elisp/Backup-Files.html

@byorgey@mathstodon.xyz wait a second, are there universities forcing people to use LLMs? 😱

@byorgey@mathstodon.xyz oh, those succesive differences are the number of copies of 1, 2, 3,... in the conjugate. In your example there are 0 ones, 2 twos, 1 three, 3 fours. So something like (untested so probably slightly wrong): conjugate p = reverse . concat $ zipWith replicate (zipWithExt (-) 0 p (tail p)) [1..length p]

@kevlin@mastodon.social I didn't know that penthouse and causeway were (originally) eggcorns! That's great.

@liamoc @maxsnew In the special case of mathematicians talking about using LLMs to write either informal or formal proofs, I don't really think anybody is lying. I think it just works sometimes and doesn't work most of the time.