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

01:53
fun!
02:22
@DLosc Literally the first entry mentions having been removed at one point--though admittedly, it was only once as "collateral damage" in the edit war it describes
 
4 hours later…
06:20
@user this is great
 
1 hour later…
07:24
I love my followers lol
I wonder if I haven't gotten any 3s, or if I just can't see responses from people whose notes I can't see
I believe it's the latter, which means I have no way of knowing how far this will get
My guess is it will die out at 3 lol
08:16
@lyxal microsoft product moment
08:52
@user Seems the first several pages are about arguing the nationality of various celebrties
 
2 hours later…
10:44
The contraversy regarding Jimmy Walice's birth date is the most funny one IMHO
11:36
CMC Go up n floors from m-th floor. n and m both can be negative. Assuming 0th floor don't exist(so n=1, m=-1 results in -1)
att
att
11:47
why would that not be 1?
12:08
no
Normally I'd edit that to something funny but I do not have words for what the alexa sam f*ck that was
 
1 hour later…
13:35
@user TIL Nikola Tesla is Martian
@Ginger +
> In the name of the programming language C#, is that # thing (octothorpe) after the C a number sign or the musical sharp symbol?
yes very important questions here
@l4m2 that's a very funny building you have there, since all buildings have a 0th floor
perhaps you should do it in terms of years, as 1BC was followed by 1AD (1BCE and 1CE for those of you who are woke)
14:42
I call the layer of gate 1st floor. Reasonable somewhere generally call it ground(0th)
15:04
Here it's usually ground = 1, so elevators go G, 2, 3 ...
and anything below ground is prefixed with B for basement, except there's one particular building I've seen where there are parking levels under the normal levels instead and those are prefixed with P--can't remember which direction those count in though, even though I was just there yesterday, because I never actually used the elevator 🙃
With academic buildings it's much less consistent--usually the floors are just 1, 2, 3, ..., but sometimes they're G, 1, 2, ..., and of course the CS department's building actually does go 0, 1, 2, ...
okay I'm unironically setting myself a reminder to take and share a photo of the elevator buttons next time I'm there in like 7 months
actually no it'll be sooner if WAIT is that the phone call I missed this morning shit
15:45
Here and in India it's usually G, 1, 2, 3
 
1 hour later…
17:06
Okay I set myself a reminder to do it in 4 months :P
 
2 hours later…
19:26
@UnrelatedString At CMU we do 1, 2, 3, ... for above ground levels and
A, B, C, ... for basement levels (higher letters are lower floors)
Although as hilly as Pittsburgh is, many of the buildings have entrances at dramatically different floor levels, so it's somewhat arbitrary which floor is 1
E.g., Doherty Hall has entrances at every floor from 1 to E
(Few know there is an E floor though, since it just has a loading dock with a locked door, and a locked maintenance area)
Hamerschlag Hall has entrances from 2 to F (if you count bridges to other buildings), which is probably the widest range
Some of our elevators do use B for basement for single-basement buildings though, and for some reason our university center has LL instead of A
Very few Gs though, only one I can think of off the top of my head is the D floor of Doherty, which is labeled G on the frassenger elevator
Oh the Mehrabian CIC has G1 through Gn for the parking garage levels
But yeah most elevators here go B, 1, 2, ... or ..., C, B, A, 1, 2, ...
We've got one elevator at the connection between two buildings that has buttons for both buildings, so it has floors B, A, 1, 2, 3, 6, 7, and 8 lol
With 6-8 being Wean and B-3 being Doherty
Margaret Morrison Hall has B1 and B2 for the elevator buttons, but the room numbers use the A, B, C notation
Ooh we actually have another elevator that connects two buildings: the ANSYS Hall main elevator has landings on Porter B and Porter 2
Both of which are secure areas, which is interesting (you need a key card to use those buttons ofc)
I need to get a fire key
Ooh and then there's Scott Hall, which has the floors LL, EV, 4, 5, 6, PH
Presumably to line up with Wean, which it connects to on 4-6
Smith Hall has my favorite elevator. Its B floor just puts you in a steam tunnel, no questions asked
Like no basement it straight up just opens at the end of a tunnel
Not a particularly secret one though, you can see it through windows in the robotics highbay
The Wean Hall lobby is floor 5
For that I've building I guess they decided to use 1-indexing instead of having basement floors, so the lowest known floor is 1 (and it's tiny, just a door to the outside and a single hallway)
19:54
Here they use 1, 2, 3, and so on. I used to live in the basement at my old dorm, and the rooms were labelled 0xxx but the elevator said G, I believe
There's another building at my university that has a floor with rooms labelled 0xxx and then another floor beneath with rooms labelled Bxxxx (never seen what the elevator calls them, but I assume G and B)
@rydwolf Yep, same here--the CS building here has just as many entrances on floor 0 as floor 1 (or rather, it's technically considered two different buildings since a later-built extension has a different name, and the older one has all of its entrances on floor 1 while the newer one has all of them on floor 0)
and the linguistics/Romance/Germanic+Slavic building has a vast majority of its entrances on floor 1 but they're just kind of weird back door type things that are used almost exclusively by either faculty members or me because the entrance that has any actual signage and leads to a nice fancy atrium with a bunch of actual classrooms nearby is on floor 2
@rydwolf Whoa, sweeeet
We only have, like, AFAIK one pair of buildings total with any kind of bridge between them and it's above ground
but I think supplies for one of the dining halls go in through the underground loading dock built riiiight under the library so I imagine the library also shares that dock
and there's another such dock that's just kinda. underneath a grass-lined pedestrian walkway and not especially close to any of the adjacent buildings, and I can't figure out where the hell it's actually connected to
One of said buildings does have multiple basement floors unlike any of the other ones I've looked through but they don't seem to connect anywhere unfortunately
The majority of our relevant buildings are connected
some of them without tresspassing :p
niiiiiiiiiiiice
:p
Sky bridges and tunnels have always just been the coolest shit to me
Think my first exposure was in especially positive experiences roaming the giant hospital complex the 2 or 3 times my dad was hospitalized :P
20:09
As far as legal connections, Baker-Porter-ANSYS forms one complex. Roberts-Hamerschlag-Scott-Wean-Doherty-Newellsimon-Gates is the biggest chain, and since Hamerschlag is adjacent to ANSYS (technically connected via a makerspace), they form one giant complex. You can also get to Smith, Tepper, CFA, Margaret Morrison, Posner, Highmark, the University Center, and the Hall of Arts through known steam tunnels
oh wait yeah come to think of it we do actually have at least one other bridge between buildings--Campus Health has a bridge to a couple wings of the medical school, and I think there's direct connections from the medical school into the actual hospitals which aren't even part of the university
oooh nice
As far as major academic buildings, Scaife, Hunt Library, Hamburg, Purnell, and TCS are the only ones I can think of that you can't get to legally or illegally without going outside
Technically I believe it's possible to get to most of Pitt's campus too since we get our steam from the same boiler plant
pffffffffffffffffffffffffffffffffffff
20:12
That's capital-T tresspassing though
I can imagine LMAO
There's one tunnel which exists on an old student-made map, but which is described as a conduit on the official steam tunnel map I have. The building at the other end of it (Scaife) has since been torn down and rebuilt, but there's a very small chance that it both is a tunnel and still connects, in which case Scaife is accessible
And there's a very suspicious trapdoor and path of torn up grass leading from the Gates garage to Purnell, so there might now be a tunnel connecting those
And Hunt is labeled on the official steam tunnel map as having a tunnel connection to Baker, but it's not labeled on any other maps I can find, so it may have been a mistake
Hamburg definitely connects to something through a tunnel somewhere, but since it used to be owned by the federal government rather than CMU, it's hard to find old plans and blueprints
20:49
@UnrelatedString My first job was at a hospital, and I was really pleased with myself when I figured out how to get all the way from my office to the parking garage next to the bus stop without going outside.
 
1 hour later…
21:58
Am I crazy or is this not alphabetical order: codegolf.stackexchange.com/q/12615/56656
Looks alphabetical to me?
b comes before aa.
Looks good to my installation of Excel
Interesting.
Bijective base-26? https://en.wikipedia.org/wiki/Bijective_numeration#The_bijective_base-26_system
Unrelated, I'm trying to draft up a new golf lang idea and I found out Google Docs uses ¶ as an invisible formatting character
22:10
@WheatWizard I think the idea is it's alphabetically sorted within each length
'cause like, if you tried to enumerate every string in standard alphabetical order you'd never get past a*
Is there another way to list every infinite combination of letters whilst being able to reach any particular sequence in finite time?
Other than reversed order, I suppose...
a, b, c... aa, ba, ca
(Or any shuffles of the alphabets used)
I guess as long as you define a sorting such that a higher letter comes before at least one longer string, it should be possible?
I mean I guess you could do something like "list every string in alphabetical order up to length N, then do the same for lengths between N and N*2"
and so on
Probably, someone can do a, aa, b, aaa, ab, c, ...
yeah there's tons of ways you could do it, I guess it's just about whether or not there's another interesting way of doing it
I don't know why any sane being would do this, but it's possible...
22:30
Science isn't about why
That's why mad scientists are a thing :)
I'm not mad, just disappointed Scientist
@WeirdGlyphs Yeah, that's essentially the one I thought of: map a=1, b=2, ... z=26 and sort by the sum of the string's letter values
CMC: Produce every letter-combination in ^ order, coder's choice for tie-breaker
That turns into a partitioning problem, I think
22:38
@DLosc To be honest, I was originally thinking of sorting every word by length as a table, one column per length value, and then reading it diagonally. That's why ba was not there with ab, but your suggestion is way better.
Ah, I see.
23:01
@ATaco Recursive generator function in Python, 124 bytes
There's probably a golfier approach, but this is how Regenerate's backtracking algorithm works under the hood.
23:17
@ATaco There are in fact uncountably many ways to do this.
Chat mini challenge: Prove that there are as many of these orderings as there are real numbers.
Chat mega challenge: In the "standard alphabetical order" we can have infinitely many words between two words, but every pair of words is comparable, and every strictly decreasing sequence of words is finite. Prove that with these weaker conditions there are as many of these orderings as there are real numbers.
jan
jan
does the mega challenge require any two words in the standard alphabetical order are sorted relative to each other and what does standard alphabetical order mean?
23:34
Yes, that's what I meant by they are comparable. Standard alphabetical order is exactly that, the normal alphabetical order.
To prove there are no more orderings than real numbers, join all words in an ordering with semicolons (e.g. a;b;aa;c...) and take that as the base-27 expansion of a real number in [0,1).

To prove there are at least as many orderings as real numbers, take the standard ordering and group it by pairs: (a b) (c d) (e f)...
You can encode any number in [0,1) in base 2 by keeping a pair in the same order to encode a 0, and switching it to encode a 1.

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