« first day (5141 days earlier)    last day (1 day later) » 

00:48
If you run Windows 3.1 and remove RAM on fly, will it still run perfectly Because modern CPU cache is usually capable of whole windows 3.1?
only one way to find out!
01:00
Why you running Windows on an insect.
That's silly even by my standards
@lyxal not run on fly but remove on
Implies you've got ram on the fly in the first place
Removing ram on the fly isn't going to impact anything unless windows is being run on the fly
Although I'd also question how the fly isn't being squashed by the ram
Last I checked male sheep are larger than a fly
And can weigh up to 143kg
Your ram or others'?
I don't have a ram
Don't live on or near a farm
Nor anywhere you'd find a herd or livestock liketthat
 
1 hour later…
02:37
try not to be the impostor challenge (impossible)
02:52
 
1 hour later…
03:59
CMC Numbers that alternate n^2 order and reverse(169 => 196691), in increasing order
 
2 hours later…
05:49
0
Q: Is using x for × allowed?

LucenapositionIn this question (which is tagged kolmogorov-complexity), many answers used x for ×. I was wondering if this is generally allowed in such questions, since many answers used it.

 
4 hours later…
09:50
@l4m2 Vyxal 3, 8 bytes: 2⎄²:¤⇄J⌊ Vyxal It Online!
unclear if this is actually what you asked for. i'm just squaring each number and making it a palindrome each time
 
1 hour later…
10:54
Allegedly appeared in some redditors dream
11:05
> disambiguation
11:19
@mousetail someone's been browsing /r/thomastheplankengine
My favorite sub nowadays
 
7 hours later…
18:02
Would anyone recommend going to your university's counseling center for group counseling with a group for working on social skills? Have any of you had good experiences with that sort of thing in the past?
The counseling at my university has workshops, which sounds great, but they don't have any for social skills, so they directed me to group counseling. I don't know if counseling means it involves discussing your personal life with a bunch of people in a group or something
 
1 hour later…
19:33
@user My university doesn’t have counseling, but the therapy groups I’ve been to at my university have been great experiences
Three of them and counting
None on social skills but there is one about “connections” so I’m hoping to fit that into my schedule some time
that being said all of my experiences with social skills counseling have been shit, but those were all in middle school and I didn’t want to do it in the first place so that doesn’t really mean anything for you
oof
@UnrelatedString Ah nice
Is it weird talking to a bunch of strangers?
And what do you talk about?
21:21
0
A: Sandbox for Proposed Challenges

noodle personImplement Uiua's 'tuples' function In the programming language Uiua, there is a higher-order function called tuples which is a generalization of getting the permutations or combinations of an array. Tuples takes a list \$ a \$, a sample size \$ r \$, and a function \$ f \$ taking two numbers repr...

0
A: Sandbox for Proposed Challenges

Патрик СтарBurrows–Wheeler transform for binary Yes, you heard me right. Simple implementation for BWT, but with alphabet with two symbols. For position of the first original character allocate five bytes at end of file. Program must read file, transform it, and save on disc. And in reverse, read transforme...

@noodleperson I've just added some test cases here, I'd appreciate feedback on whether the challenge is clear enough, if it needs more clarity in some area, if the test cases are missing something, etc.
21:53
@noodleperson I don't think it's clear that only pairs with the correct order are checked by f
though maybe it's obvious, or < would return an empty list
What do you mean by correct order?
All possible pairs are checked
like, if the indices are a b c d, only ab ac ad bc bd cd will be checked
not ca or dc or ba
I thought with a b c it would check aa, ab, ac, ba, bb, bc, ca, cb, cc
Are you sure it doesn't?
oh Sorry yeah the duplicate ones as well
but not the opposite order ones
if it did then < wouldn't work
since a<b niff b<a
niff?
I guess "not if and only if"
but not sure what you mean by that
21:57
actually it doesn't check the duplicate ones either
If a<b is true, b<a is false
if the length is two it only checks ab
@noodleperson exactly, so if it checked both it would return nothing
Oh now I understand what you're saying
We were talking about different things
I'm saying that it calls the function with only index pairs that are strictly in order
(Uiua seems to call all possible pairs once always, probably an optimization?)
the combination a b c is kept if F(a,b) && F(a, c) && F(b, c)
is that what you're saying?
22:01
yes
That holds for > too right?
Yeah pretty sure
yeah any function
Alright cool yes I'll edit my wording of it to make it more clear
I wrote it before as "Note that \$ f \$ isn't just applied between the two pairs shown in each case above -- all three comparisons are made, but I'm showing two of them since in this case it doesn't matter"
but it's good to clarify
@RubenVerg I have edited the last sentence of the third paragraph to read: "If you look at all possible combinations of three nonnegative integers less than six, you will find that there are twenty for which all increasing pairs (i.e. a,b and a,c and b,c but not b,a or c,a or c,b) pass 𝑓". Does that seem clear?
Is there a better name for that or better way to describe it than "increasing pairs"? I feel like that sorta implies that the numbers themselves which are compared are ordered, which is wrong

« first day (5141 days earlier)    last day (1 day later) »