raptop changed the topic of #kspacademia to: https://gist.github.com/pdn4kd/164b9b85435d87afbec0c3a7e69d3e6d | Dogs are cats. Spiders are cat interferometers. | Космизм сегодня! | Document well, for tomorrow you may get mauled by a ネコバス. | <UmbralRaptor> egg|nomz|egg: generally if your eyes are dewing over, that's not the weather. | <ferram4> I shall beat my problems to death with an engineer. | We can haz pdf
<ObservatoryRaptop>
!8 will Duolingo teach all the kanji in 霧雨魔理沙?
<galois>
ObservatoryRaptop: yes
<ObservatoryRaptop>
ooh…
<mofh>
Time to find a copy of the latest Touhou game and do a runthru.
<ObservatoryRaptop>
I think it's on Steam. At least the demo was
<mofh>
So first off why would I use Steam when I can just download the installer off ZUN's site?
<mofh>
Like Steam is an inconvenience to me compared to just downloading a setup.
<ObservatoryRaptop>
ah
<mofh>
Secondly the full game just came out like hours ago, the only place it'll exist for the next few hours after that is JP-only P2P apps. It'll be everywhere in a day but my goal is to get a 1cc in as early as possible :p
e_14159 has quit [Ping timeout: 190 seconds]
e_14159 has joined #kspacademia
<B787_300>
ObservatoryRaptop: blame the issues on the undergrads
<ObservatoryRaptop>
I could, but it might well be Windows or TheSkyX
<B787_300>
dont you blame TheSky... it is a wonderful piece of software
<ObservatoryRaptop>
Blame ASCOM then?
<B787_300>
that i could see
<B787_300>
or the USB hubs that seem to multiply when doing astromomy
<ObservatoryRaptop>
Currently the other people are messing with COM port drivers
<ObservatoryRaptop>
That seems to have fixes it
<B787_300>
ah ASCOM... such a old but useful thing
<ObservatoryRaptop>
Now focus issues! (and pointing?)
ObservatoryRaptop has quit [Remote host closed the connection]
<_whitenotifier-5dfc>
[Principia] pleroy 1bf7998 - Merge pull request #2281 from pleroy/2261a Avoid a unbounded behavior introduced in #2279
<_whitenotifier-5dfc>
[Principia] pleroy closed pull request #2281: Avoid a unbounded behavior introduced in #2279 - https://git.io/fj7hb
<UmbralRaptop>
SnoopJeDi: And that is another reason why C is bad
<SnoopJeDi>
I can sort of see why it has a dedicated notation but I don't know the history and we're stuck with it in other languages (Python) now anyway so ¯\_(ツ)_/¯
<UmbralRaptop>
Python at least gives you exponentiation without having to load a separate library
<mofh__>
Iiiiiiiiiiiiiiiiiii mean eggsponentiation on floats is very very nontrivial.
<SnoopJeDi>
I don't even know the first thing about how it might be implemented!
<SnoopJeDi>
But it seems sensible that the operator is right at hand because of historical reasons where bit-twiddling was an EXTREMELY common thing to be doing
<mofh__>
x^y is basically exp(y*log(x)), which leaves out so many details of how to actually implement that so it's accurate and faithfully rounded
<mofh__>
but should at least give you some idea of why it's so complex
<mofh__>
i.e. have two transcendental functions
<UmbralRaptop>
aaaa
<UmbralRaptop>
(But if you don't have eggsponentiation on floats, a lot of basic number crunching is impossible)
<oeuf>
petted a grey cat today
<mofh__>
UmbralRaptop: I mean yes but that's why it: 1) eggsists and 2) is in libm
<UmbralRaptop>
did the cat purr?
<UmbralRaptop>
hrm
<mlbaker>
mofh__: hmm, exp(y log x) seems a bit overkill, no?
<mlbaker>
we're talking about raising a rational base to a rational exponent, basically
<mlbaker>
okay i guess computing it as (a^n)^{1/m} is stupid because the inner expression will probably overflow
<mlbaker>
but i still feel like it shouldn't be that ridiculous..
<mofh__>
I mean computing the 1/m part is just as hard
<mlbaker>
really?
<mlbaker>
i know square roots at least there's that one algorithm
<mofh__>
sure a^n is "easy" (assuming no overflow), but k'th root for *arbitrary* k is not that nice
<mofh__>
and also converting a floating-point mantissa into a rational number is itsself not that easy computationally
<mlbaker>
hm
<mofh__>
oeuf can offer more comments
<SnoopJeDi>
rootn()?
<UmbralRaptop>
/*
<UmbralRaptop>
(several megabytes of of information on numerics)
<UmbralRaptop>
*/
<oeuf>
meow
<oeuf>
mofh__: I've only done it for k=3
<mofh__>
oeuf: I mean eggsplain why it's so hard for *arbitrary* k instead of fixed k.
* SnoopJeDi
suspects the answer is ~ number theory ~
<SnoopJeDi>
or uh, Abel's theorem I guess? not so numbery
<mofh__>
I mean computationally, not theoretically >_>
UmbralRaptop has quit [Ping timeout: 202 seconds]
<oeuf>
mofh__: i can't say i've seriously looked at rootn
<oeuf>
it's quite obvious that it's going to be a rather different kind of problem than cbrt, but I only really know about the latter :-p
UmbralRaptop has joined #kspacademia
<_whitenotifier-5dfc>
[Principia] eggrobin commented on issue #2282: Flight planner is bad - https://git.io/fj5nw
<_whitenotifier-5dfc>
[Principia] eggrobin closed issue #2282: Flight planner is bad - https://git.io/fj5e8
<galois>
[WIKIPEDIA] Abel-Ruffini theorem | "In algebra, the Abel–Ruffini theorem (also known as Abel's impossibility theorem) states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. The theorem is named after Paolo Ruffini, who made an incomplete proof in 1799, and Niels..."
<galois>
title: Abel–Ruffini theorem - Wikipedia
<_whitenotifier-5dfc>
[Principia] Hubcapp commented on issue #2282: Flight planner is bad - https://git.io/fj5n1
<mlbaker>
so I'm pretty sure this isn't relevant here; this theorem states there is no solution in radicals to a polynomial of deg >= 5
<mlbaker>
but x^N + A = 0 clearly does have a solution in radicals
<mlbaker>
the point is just that there *exist* certain polynomials that are too complicated, which precludes a general formula from existing
<SnoopJeDi>
the utter failure of my intuition is at this point my expectation
<SnoopJeDi>
(perhaps I should stop using the goddamned thing)
<mlbaker>
nah, i feel like this theorem is widely misinterpreted
<mlbaker>
there are many many people under the impression that it says that quintics are all insoluble lol
<mofh__>
mlbaker: I mean *I* had that impression until like third-year that quintics are all insoluble via radicals
<_whitenotifier-5dfc>
[Principia] pleroy commented on issue #2261: Computation of markers is costly - https://git.io/fj5cI
<_whitenotifier-5dfc>
[Principia] pleroy closed issue #2261: Computation of markers is costly - https://git.io/fj9IA
<oeuf>
mofh__: somehow #principia is talking about cube roots now
<oeuf>
mofh__: also why do you have a tail
<oeuf>
^^mofh__
<SnoopJeDi>
!wpn -add:adj vestigial
<galois>
Added adj 'vestigial'
<_whitenotifier-5dfc>
[Principia] pleroy commented on issue #2247: Poor performance at max timewarp in Realism Overhaul - https://git.io/fj5cl
<UmbralRaptop>
kitty!
<SnoopJeDi>
猫
<SnoopJeDi>
「にゃー」
mofh__ is now known as mofh
<mofh>
oeuf: good question, fixed that.
<mofh>
also yeah I just noticed
UmbralRaptop has quit [Ping timeout: 202 seconds]
UmbralRaptop has joined #kspacademia
UmbralRaptop has quit [Remote host closed the connection]
UmbralRaptop has joined #kspacademia
<mofh>
let's play "meteor or thermal noise in my retina"
<mofh>
doing this from central Paris is silly but I'm not sure I feel like heading out to Fontainebleau again.
<oeuf>
mofh: catpiiiiics
<oeuf>
mofh: cats should be easy to distinguish from thermal noise
<mofh>
oeuf: I mean yes, one just meowed at me :P
<oeuf>
mofh: caaaaaatpiiiiiiics
<mofh>
yes mother
<oeuf>
^^mofh__
<mofh>
there's only me and mofh_ (who is me on another machine) now :p
<galois>
title: Casey Handmer, PhD on Twitter: "In the absence of any official closure, I wrote a "lessons learned" report about the c. 2014 Caltech astrophysics sexual harassment debacle. https://t.co/B8W5iT3PQo"