« first day (4822 days earlier)      last day (43 days later) » 

12:28 AM
@RydwolfPrograms Yes, because they've been elected president. That's the really clear-cut part of the 22nd amendment: "No person shall be elected to the office of the President more than twice." Doesn't say anything about them serving.
 
@Seggan Xander Henderson?! On a non Mathematics.SE site?! Impossible! :p
 
1:10 AM
@lyxal At least they didn't find out about the illegal cookie sock exchange we've been running in the background
 
you do understand that the idea is to keep it secret
 
 
1 hour later…
2:15 AM
I think I'm decided on Carnegie-Mellon
Only issue I really have with it is how much I loved NYC lol
Not sure it's worth going to SBU/NJIT just for convenient transit to the city tho lol
I can just go there for vacations or something
I do have lots of friends going to colleges in New York so I could stay with them
it's right in that awkward zone where driving is too long but flying feels too short
We need high speed rail fr
Looks like you can get a round trip for like $60 if you time it carefully, that's not that bad
You just have to deal with all the TSA's bs
Like all they're doing is making it MORE fun to blow up a plane. Limitations breed creativity.
Idk why but some colleges seem to have consistently more attractive stiudent populations than others
 
2:53 AM
@lyxal uhhhh...
@DLosc yeah iirc some presidents ran twice but served 3 times
 
3:10 AM
@Seggan xander is a mathematics.se mod :p
 
3:46 AM
@RydwolfPrograms just live in NYC and commute to PA every day, easy
 
4:01 AM
PythonAnywhere is located in the United Kingdom though
why would rydwolf want to go to England every day?
 
 
3 hours later…
7:11 AM
return [A=std::vector<int>(10000)](int i) mutable { return ++A[i]; }; works but can typename of A only auto?
 
7:39 AM
sock exchange? is that where you operate each other's sock puppets to make it less obvious?
6
 
 
2 hours later…
9:15 AM
codegolf.meta.stackexchange.com/a/22251 Do 0-byte solution exist?
 
I have 1 byte
 
@emanresuA R(aka. Turing Complete) is NP-Hard, not NPC
 
Pretty sure you can encode any NP-complete problem into a Turing-complete language?
 
NP-complete should be NP, Turing Complete isn't
 
Sure, it can do more than just solve the problem, but solving the problem is all you care about
 
9:27 AM
NP-complete includes difficulty upperbound
 
 
2 hours later…
10:59 AM
posted on April 12, 2024 by trichoplax‭

$N$ vessels initially contain $3$ stones each. What is the probability of having at least $3$ stones in the first vessel after moving a uniformly random selection from the first vessel to the se...

 
11:42 AM
@lyxal Because Britain is posh enough to make it worth it.
 
 
1 hour later…
1:09 PM
@lyxal i see
 
ssh server has finally been moved to another port
I put Endlessh on 22 instead for the funny
seems like most people banging on my door are smart enough to have a timeout for the connection
 
1:44 PM
0
A: Sandbox for Proposed Challenges

noodle manSuperimpose two images Given two RGB images A and B of the same dimensions, and an opacity O as a percentage out of 100 or as a fraction, output A with B overlayed on top at that opacity. I’ll write a spec with some test cases later

 
2:39 PM
@Ginger thanks, now i cant login :P
 
lul
use port 2210
 
 
1 hour later…
3:45 PM
@Ginger What is the SSH server for?
 
 
1 hour later…
5:11 PM
0
Q: Maximum number of trailing zeros

jmchappellInput Positive integers a and b defining an interval of integers [a .. b]. Output The maximum number of trailing zeros in the binary expansion of any integer in the interval [a .. b]. Examples Input: [17 .. 21] ; Output: 2 ; since 20 corresponds to 10100 Input: [22 .. 37] ; Output: 5 ; since 32 c...

 
5:51 PM
2
Q: Can falsehood be measured? If so, would it be continuous or discrete?

HoomanThis question occurred to me after reading the question "Does it make sense to say that one false scientific theory is closer to the truth than another?" From what I gathered, the only way to compare ideas at all would be to compare their 'level of correctness', which seemed far too difficult if ...

definitely ShowerThoughts.SE
 
 
2 hours later…
7:34 PM
wtf lol
 
I like the tag lol
6
 
LMAO
I just saw that
 
0
A: Sandbox for Proposed Challenges

TbwOutput a 1-2-3 sequence For the purposes of this challenge, a 1-2-3 sequence is an infinite sequence of increasing positive integers such that for any positive integer \$n\$, exactly one of \$n, 2n,\$ and \$3n\$ appears in the sequence. There are infinitely many such sequences (left as an exerci...

 
@lyxal D: I'm sorry, it must've been me. My stomach's been messed up all week so I've been dropping logs left and right, guess I accidentally dropped some business logs too
3
 
8:29 PM
ಠ⁠_⁠ಠ
 
 
1 hour later…
9:35 PM
@RydwolfPrograms the ports still don't seem to be working
I did the thing with the firewall
(I think)
oh wait hang on
yeah it's not letting me in
:(
you still have them going to the VM
 
10:31 PM
@hyper-neutrino my dad commutes back and forth from nyc to philadelphia every three days, so i can say from personal experience: not easy
 
 
1 hour later…
11:33 PM
Q: You do maximum independent set I do minimum independent set in polynomial time, and we share the prize
A: Let's say require to break record, aka, you do minimum independent set in o(1) time with output
 

« first day (4822 days earlier)      last day (43 days later) »