« first day (4259 days earlier)      last day (600 days later) » 

4:00 PM
above every function you need to write a comment what the function does, except the comment is just a exact copy of all the comments inside the function
 
horrid :P
any feedback for rpsls+? i think its pretty cut n dry but i wanna make sure everything reads clear :-)
 
I'd maybe expand the title
 
oh good point
not sure how the + translates though
considering:
Rock Paper Scissors Lizard Spock+
Rock Paper Scissors Lizard Spock +
Rock Paper Scissors+
Rock Paper Scissors +
 
"N-element rock paper scissors"
 
oh duh :P ok no clickbait then
ty
also known as Nerps
 
4:08 PM
Lol turn it back into a unmemorable acronym
 
tempting
 
What would you name the last 2 elements in 7-RPS?
 
do i have to use lizard and spock for my 4th and 5th?
cause i dont know enough about star trek to account for spock
 
No you don't
you don't even have to use rock paper scisors as the first 3
I used to play with rock-laser-mirror
 
whaat
that sounds fun
 
4:18 PM
omg thats so fun
 
It's exactly the same game lol
 
well yeah but
yknow
lazers
pew pew
 
That's a gun not a laser
 
a laser gun
 
laser guns make no sound
 
4:20 PM
jokes aside i actually did spend an unreasonable amount of time studying the nontransitive cyclical relationship between rock paper scissors elements, trying to give them names / "numbers" that represent their place
etc
results were inconclusive because im stuptids
 
I think you can arange them in a circle with complex numbers
wait nvm that would imply everything defeats itself
 
@mousetail i just had to search up "can a laser break a mirror"
 
IRL yes
In fiction no
IRL it's just the brightness that matters not the reflectivity
 
What's that error-detection code called again which uses primes as its weights?
 
@mousetail yeah i read that once the laser is strong enough the electric field around the laser will ionize anything it touches
 
4:25 PM
@mousetail i did one time try to relate rps to complex numbers too lol, i started with R^2=-P, P^2=-S,S^2=-R, and that all of them were nonzero
 
and then your laser turns into a plasma cutter
 
turns out, multiple solutions, various 7th roots of -1
 
I think the idea with the laser mirror is that the mirror reflects some of the beam back into the laser device. It might break itself too but at least it can damage the device
 
@thejonymyster what is that supposed to tell you :P
 
@thejonymyster Maybe you can use vectors then cross multiply them? Since cross multiplication is inverse comutative
 
4:27 PM
@Seggan not much, its just a thing i did.
i was grasping at straws :P
 
-1 is a solution
 
-1 is a 7th root of -1, yes
 
wait so that implies everything defeats everything else?
 
it doesnt imply anything about the game :P it wasnt very useful as an experiment
@mousetail i also tried vectors but it also didnt seem analogous to the game with various operations, or again i was too stupid to find the relationship
i spent a lot of time on this but i didnt know what i was doing XD
 
It's a suprisingly hard problem
 
4:30 PM
what so what is the problem
 
rock paper scissor numbers?
 
Find a operation in math that can work analogous to RPS
 
heres another possibility wolframalpha.com/…
R>S, S>P, P>R is the logical way of thinking of it but no numbers can satisfy it
wolfram is still solving it :P
@Seggan P=-2, R=2, S=1 is one
 
wait what
 
for the relation R^2>S, S^2>P, P^2>R
 
4:40 PM
@mousetail :P
 
tho is squaring RPS allowed?
 
I don't see why not
Is R^2 must be <= P though
 
uff
 
@Seggan i used that because it seemed appropriately related to like, imaginary stuff?
its probably not the best way to go as far as modelling the game mathematically
 
0
Q: It's Just Rocket Science

pigrammerWrite a program/function that finds the amount of fuel needed to escape Earth's gravity well given the exhaust velocity of the fuel and the amount of mass to transport using the Tsiolkovsky rocket equation: $$\Delta v = v_\text{exhaust}\ln\dfrac{m_\text{start}}{m_\text{end}}$$ where \$\Delta v\$...

 
4:43 PM
misread
@mousetail why
 
Otherwise everything beats everything
it's not really rock paper scisors if all combinations give the same value
 
its not equal tho
idk what squaring a rock is :P
 
@mousetail i suppose another good thing to look at would be something like the surreal numbers, but theyre way above my head beyond basics
 
@Seggan I don't think your equation works at all, the first inequality isn't even true when not flipped
 
maybe as functions, where R(x) < P(x) < S(x) < R(x) ?
that fails right?
 
4:51 PM
 
@thejonymyster from your inequality it follows that R(x) < R(x), that is clearly false
 
right lol ok i missed that
@mathcat the idea seems solid if a little easy. some of the phrasing is a bit weird, "An advantage with parity bits is, that they can't detect errors only when a multiple of n bits have been altered." seems like not an advantage? theres a couple other parts like this, im nitpicking though
 
With a single parity bit you can't detect errors 50% of the time
 
ohh
what happens if you use more parity bits than the length of the message :P
 
i found it
assuming R = 0, S = 1, P = 2:

R - P mod 3 = P
R - R mod 3 = 0 (tie)

S - P mod 3 = S
S - R mod 3 = R
 
5:03 PM
woah
 
credits to this guy
basically, a - b mod 3 = 0 if tie, otherwise a - b mod 3 = the winner
 
wait
but R is 0
S - R mod 3 = 0, is that a tie or did R win :P
 
oops misread
a - b mod 3 = 0 if tie, otherwise a - b mod 3 = 1 if a, 2 if b
 
ahh
that makes more sense
 
0
A: Sandbox for Proposed Challenges

mathcatPrime checksum Given a message, append a checksum digit using prime numbers as weights. A checksum digit is used as an error-detection method. Take for example the error-detection method of the EAN-13 code: The checksum digit is generated by: Multiplying each digit in the message alternating by ...

 
5:08 PM
then heres the corrected list:
assuming R = 0, S = 1, P = 2:

R - P mod 3 = 2
R - R mod 3 = 0 (tie)

S - P mod 3 = 1
S - R mod 3 = 2
 
@Seggan I think you have your 1s and 2s switched. 0 - 2 mod 3 is (-2) mod 3 is 1, not 2
 
5:26 PM
i think i do
 
Is there a sequence (except Fibonacci) where a recursive approach is shorter than the iterative one?
 
iterative is shorter for fib too
in golflangs at least
or is it more properly called reductive
 
yeah it depends on the language a lot i imagine
 
5:57 PM
@Seggan Nice
does it work with 5 and 7?
 
@thejonymyster clarified that
 
@mathcat ty that clears it up, especially the latex stuff after
 
58 mins ago, by Seggan
assuming R = 0, S = 1, P = 2:

R - P mod 3 = 2
R - R mod 3 = 0 (tie)

S - P mod 3 = 1
S - R mod 3 = 2
check the reddit post
did phil.SE get a new logo?
 
6:40 PM
Yep
Sep 19 at 20:31, by DLosc
Ooh, Philosophy.SE got a site design
 
7:03 PM
@Seggan dont call it that i just went on a site called phil.se i could have gotten a viroso x_X
 
i mean .SE is pretty obvious what it means
 
ok fair enough i honestly thought itd redirect
like a youtu.be or something
 
or mathcat.surge.sh
 
T_T i was excited to check out your cool website
 
@mathcat Been there, done that
 
7:19 PM
Rule 34: Never assume a surge.sh website is not a rickroll
 
You can blame a friend of mine for that one
 
@Seggan how to delete browser history along with proof that i ever had a browser
 
@Seggan what the actual frick
 
7:26 PM
The new version is even worse
 
7:49 PM
Okay so, my golfing languages are going to have two number types, floats and ints
Any time they're used together, a float is returned
If an arithmetic operator is given no inputs, for example, add(), should it return a float or an int?
A float would make sense since that's the "main" number type, but an int would make sense since it's more of a recessive trait, and will keep the type of whatever it's added to (so it behaves more like a no-op)
 
@RadvylfPrograms depends, do you want f(noarg(),int) to return a float or an int?
 
8:22 PM
@RadvylfPrograms Int, for the reason you mentioned
 
(my personal vote is also int yea)
 
8:43 PM
CMC: Compute the following sequence (standard rules apply):
0: []
1: [[]]
2: [[],[[]]]
3: [[[]],[[],[[]]]]
4: [[[],[[]]],[[[]],[[],[[]]]]]
etc.
The first two terms are [] and [[]]. After that, each term is a list containing the previous two terms.
 
omg the fibonacci set :heart_eyes:
in js its probably only slightly longer than the fib answer, literally just copying the definition
 
40 bytes in python, Try it online!
 
9:09 PM
38 bytes as a full program that prints forever
 
9:47 PM
posted on September 27, 2022 by trichoplax‭

Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An ...

 
10:13 PM
posted on September 27, 2022 by trichoplax‭

This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 55 fruits. You may choose an...

 
10:38 PM
Prolog 47 bytes: tio.run/##FYwxC4UgGAD/…
 
@DLosc Fig, ~7.408 bytes: Gw`)W`)@w
 
Could probably be shorter but I’m a newb lol
 
im sure can be made shorter (the Fig answer)
 
Ok wait 45 bytes by taking out the parentheses
 
@DLosc Vyxal, 8 bytes (wow this is unreadable)
get destroyed fig
@DLosc 37
 
11:06 PM
@thejonymyster im wrong, no idea how to approach it in js :P
 
11:27 PM
@DLosc Isn't that the standard set-theory building of integers?
@DLosc Jelly, 3 bytes
 

« first day (4259 days earlier)      last day (600 days later) »