> apt install texlive-full
*goes away to do some other stuff for a while*
Remote
julesh
@julesh@mathstodon.xyz
mastodon 4.7.2Applied Compositional Thinking
2099 Followers
151 Following
50 Posts
Joined October 30, 2022
Here is an extremely neat definition of dependent lenses I've never seen before, as kleisli morphisms of the extension (ie. the equivalence of categories from containers to polynomial functors) considered as some exotic kind of generalised monad
When your brain is smooth so all the thoughts just run off it, that's called a thoughterfall
It occurs to me that if actually working AI was developed 70 years earlier, as many of the earliest pioneers of the field apparently expected, it would definitely have been immediately compromised by hyper-capitalism back then too
New profile picture who dis (not sure I'll keep it yet)
Reason number whatever that I already hate linux + kde coming from a mac: keyboard shortcuts for diacritics are just shit. After a ridiculous amount of trial and error I have managed to type ëẽéêèẹȩ, but as far as I can tell it is straight up impossible to type ė (a diacritic used in Lithuanian) which is the thing I was actually trying to type
Very proud that I successfully did my nails on a moving train without any major mishaps
🚄 : Glasgow → Edinburgh → Durham
Boosted by @GroupNebula563@mastodon.social
I feel like enough time has passed that somebody could get away with making a new sketch about the Spanish Inquisition. For sure nobody would expect it.
In this paper we improve the bound on the value of Dylan's constant 𝐷. This value, first defined by Dylan [1963], is the number of roads that a man must walk down.
We briefly recap the history of Dylan's constant. Although it is not a priori obvious that a man must walk down a finite number of roads, a relatively elementary nonconstructive proof that 𝐷 is finite, using the pigeonhole principle, was quickly given by Yarrow, Stookey and Travers [1963]. The first explicit bound, a stack of exponentials of height 5, was found by Wonder [1966]. This bound was significantly improved by Baez [1976] to 𝐷 ≤ 420 using methods of higher category theory. Although this bound remains the best known currently, Adams [1980] conjectured that 𝐷 = 42 based on extensive computer calculations.
If you overflow the level of a bath then it wraps around to the maximum negative fill level, creating a column of water down to the floor downstairs
Replying to
I grew up in the AI winter too. But my heart is in the 1960s cybernetics movement.
I have a new nsfw alt for hornyposting and nudes. I won't drop the link on main, but reply or dm me and it's very likely I'll send you the link (will happily trade alts too)
The function "curry" returns NaN which stands for "not a naan"
Replying to
Perhaps it would be more sensible and/or less controversial to create a brand new degree programme in AI, whose first year is initially frankensteined together from modules of mathematics, statistics, physics and computer science
Replying to
I think that disagreeing with "LLMs are now central to computer science" would be ahistorical, and probably held mainly by people who grew up in the AI winter. For the vast majority of the field's existence this was *the* flagship problem.
I don't see what all the fuss is about over the power consumption of AI, a perfectly good solution has been there all along
I'm getting subtwoten, just like the good old days. Have to go really over the top with unpopular takes just to mimic a fraction of the power of algorithmic content curation.
Being born gets you put on a government watchlist
The true map of London, ie. the London conurbation (population just under 9.8m)
Replying to
Recognising "wouldn't it be nice if everyone would just not play the unique dominant strategy" as a fallacy is baby stuff. You have to do *real* theory.
Train I was on replaced "where this train terminates" with "where this train finishes its journey". It's political correctness gone mad, next thing you know they'll be replacing "inclement weather" with a word that isn't made up
Replying to
@mc@mathstodon.xyz @SvenGeier@mathstodon.xyz I'm pretty sure 99% of people in finance are not spending all day staring at data looking for patterns. There have been statistical algorithms that do that more reliably than humans since the 90s
Replying to
@johncarlosbaez@mathstodon.xyz @pigworker@types.pl I learned the same thing but the other way round (this is not a coincidence, we were in the same place when it happened). I knew this operation was a monad but didn't know it was the free monad monad
Said in terms of just polynomial functors, the operation p* defined as the least fixpoint of p*(y) = y + p(p*(y)) (that's the least fixpoint of an endofunctor on Poly) is both a monad -* on Poly, and also has the property that p* is a monad on Set for every p
Replying to
@mc@mathstodon.xyz This also plays into my conspiracy theory that quant finance was a decade ahead of the rest of the world in deep RL when it peaked around 2017 (aka they knew some stuff back then that nobody knows to this day), but then were completely blindsided by the transformer architecture (which for them is probably far more useful to run on raw time series data than on language)
Queering the binary/nonbinary binary
Replying to
In theory a dot matrix printer could print 1 page in the time a laser printer could print like 20 pages, but in reality a dot matrix printer could print 1 page in the time that a laser printer can tell you that it's out of cyan
Attempted to result to using Debug.trace for debugging in idris; discovered that unsafePerformIO is actually broken in idris; found the issue opened by @gallais@mamot.fr 4 years ago
https://github.com/idris-lang/Idris2/issues/2306
I have a category theory question that turned into a set theory question. If you have a functor F : Setᵒᵖ → Set which I promise is representable then you can easily get the the representing set, up to unique bijection, as F(1). What about for a functor F : Set → Set?
If you do F(2) that tells you the powerset of the representing set. Is that enough to know the set? Is powerset injective on sets? If so, is it true in just ZF or do you need more?
Is there a less horrendous way to get back the representing set of a promised-to-be-representable covariant functor, other than trying to invert the powerset operation?
Replying to
@mc@mathstodon.xyz oh my god, I'd never been able to figure out why they keep funding and talking about pure maths, the best explanation I could come up with was to mumble about the rationalist cult and AGI, I don't know why I didn't think of this but suddenly everything makes sense
Replying to
@pettter Natural language communication, and associated things like common sense reasoning
Replying to
[desperately trying to remember what qbaisc syntax looks like]
DIM age%
PRINT "How old are you?"
INPUT age%
IF age% < 13 THEN GOTO jail
Replying to
@tranquillity@mastodon.minionflo.net we're gonna have to teach the kids haskell so they can use combinators and pointfree style
Replying to
@michael_ Not for any specific reason, more like a *should*, because AI has been a historical beacon in the field since the very beginning
Replying to
@tranquillity@mastodon.minionflo.net just saying LLMs are incredibly good at frontend, at least anything that's just styling and doesn't have complex logic, the main problem is it would look so professional and corporate nobody would trust it
Do Lithuanian catgirls come from Vilnyas
Replying to
@lisyarus@mastodon.gamedev.place Sounds plausible... I would like to extract the set of elements, I'm thinking that if you delete the bottom element of the lattice then the set of elements is given up to bijection by the set of remaining minimal elements, which are the singleton subsets
Piketty pointing out that macroeconomic growth is counterintuitive because it is exponential and measured logarithmatically: "growth rate on the order of 1% is in fact extremely rapid... in generational terms. Over a period of 30 years, a growth rate of 1% corresponds to cumulative growth of more than 35%... in practice, this implies major changes in lifestyle"
Replying to
@Andrev@types.pl It's at least not expected coming from haskell, where unsafePerformIO performs IO, even in interactive. Perhaps the idris version should be renamed to unsafeBuildFreeSyntaxButDoNotPerformIO
Replying to
Replying to
@boarders None of the cs degrees I've interacted with give enough background in lower years in things like calculus and probability/information theory and data handling methods. In many places it's probably possible with students choosing a very specific combination of options
Replying to
@migratory Deep understanding is not the same thing as being able to make guarantees, except in very specific fields like physics where the universe is nice to you. For example in social sciences you can never make guarantees about anything, but that is no reason not to make a deep study of social sciences
🚄 : Durham → London