The Nineteenth Byte

12:06 AM

0

Q: Hamiltonian levencycle of 1-dup permutations

The word "levencycle" is inspired by cyclic levenquine challenge. Definitions A 1-dup permutation of order \$n\$ is some permutation of \$1, \cdots, n\$ plus one duplicate number in the range. For example, 1-dup permutations of order 3 include 1, 3, 2, 2 and 3, 2, 1, 3. There are 36 distinct 1-du...

hyper-neutrino

@NewPosts i have 21 bytes but i'm not satisfied with that length

it also won't run for higher than 2 within the lifespan of the universe i think

caird coinheringaahing

Compared toa lot of submissions here, that's very efficient :P

hyper-neutrino

true :p

i do brute force every permutation so that's ((n+1)!*n/2)! so uh

caird coinheringaahing

@cairdcoinheringaahing CMC: Take an array, generate the result of Ṭ, then convert from binary (with the most significant bit at the end, not the start)

hyper-neutrino

untruth, upend, unbinary :p

caird coinheringaahing

12:20 AM

The three U's :P

hyper-neutrino

yep :p except that only one of them is an actual U in terms of appearance

T. U B. i think

Bubbler

TUB: The Undecillionth Byte

(apparently it's the smallest number starting with U)

caird coinheringaahing

Why does this work, but this doesn't?

wait what

hyper-neutrino

probably has something to do with the way jelly does tail recursion

since you're calling the second link monadically in the failing example, that causes the (only) (variadic) chain to be a monad, and I guess a dyad within a monadic chain decides it can't TCO even though it can?

caird coinheringaahing

It's definitely something to do with monadic vs dyadic chains: ðçḷṛ? works for the second line as a 2 line program

hyper-neutrino

12:31 AM

idk all i know is that i didn't really get how jelly was doing TCO and I think yuno's is much stronger :p

caird coinheringaahing

I don't actually think Jelly's dyadic chains do use TCO

hyper-neutrino

github.com/DennisMitchell/jellylanguage/blob/master/jelly/…

Unrelated String

i tried looking at the actor code and i didn't see anything that struck me as such

hyper-neutrino

this is where monadic chain does TCO, it only works on another monadic chain

Unrelated String

but that was a while ago

Bubbler

12:32 AM

Wait, TIO-encoded "Jelly" contains literally "Nyan"? How could I miss it until today?

Unrelated String

ah

@Bubbler it took me a while to stop noticing it

hyper-neutrino

@Bubbler lol yeah it's pretty great :p

i still notice it

caird coinheringaahing

This is the commit adding in TCO for monadic chains

hyper-neutrino

@cairdcoinheringaahing you're right

???? tf then

caird coinheringaahing

The code added to monadic_chain - there isn't the same/similar in dyadic_chain

Unrelated String

12:33 AM

i wonder if it's something to do with

wait i should actually look at the code i don't know if this even happens

hyper-neutrino

for comparison, this (monads) and this (dyads) is where yuno does TCO, and it's even able to TCO a 2,1 chain, 2,0/0,2-pairs, and certain modified functions (like @ doesn't break TCO)

this is the parsed result

Unrelated String

yeah no i'm not going to try to figure out if this is actually what it does
don't actor quicks do something like actually insert what they refer to into the chain?
i think by adding an extra layer of indirection with the extra `ç` you're stopping it from having the chain blow up in memory before it's evaluated by inserting a line with a reference to the line instead of the line itself
i ahve no idea if that's even plausible and if it is the case then holy hell is that cursed

caird coinheringaahing

@UnrelatedString oh wait hang on

yeah, they do

Unrelated String

:\

jelly moment

caird coinheringaahing

Or, wait maybe they don't

hyper-neutrino

12:40 AM

both results together

caird coinheringaahing

Ok, so the quicks (ßçÑ) all directly insert themselves into the chain

The hypers Ŀ dont I think

Unrelated String

...

:|

hyper-neutrino

yeah cuz the hypers aren't always the arity they claim to be

Ŀ applied to a dyad returns a dyad that calls a link monadically

caird coinheringaahing

				elif token in hypers:
					x = chain.pop() if chain else chains.pop()
					chain.append(hypers[token](x, links))

hyper-neutrino

my explanation here is correct as far as I can tell, from scanning the source code for each quick

caird coinheringaahing

12:42 AM

Nope, the hypers also insert themselves into the chain

hyper-neutrino

wait wdym insert themselves into the chain

as opposed to what?

caird coinheringaahing

Not inserting themselves into the chain

Unrelated String

wait i didn't even fully register that the mystery code is using ñ instead of some kind of circle of çs

hyper-neutrino

wait how else do quicks apply if they don't insert themselves into the chain

am i dumb

Unrelated String

so

hyper-neutrino

12:46 AM

lol tf

		elif chain[0].arity == 2:
			ret = dyadic_link(chain[0], (ret, arg))
			chain = chain[1:]

Unrelated String

when i actually read it i

...

caird coinheringaahing

@hyper-neutrino hang on, I think I was thinking of a different thing

hyper-neutrino

monad ^ v dyad

Unrelated String

what

hyper-neutrino

		elif chain[0].arity == 2:
			ret = dyadic_link(chain[0], (ret, rarg))
			chain = chain[1:]

the only difference is that dyad uses rarg............... which should be the same as arg here no matter the arity of the chain since we're calling the link monadically

... wait

caird coinheringaahing

12:48 AM

I was thinking that when you call e.g. Ç it gets the code from the previous line and actually inserts it into the chain, like what ⁺ does

Unrelated String

yeah that's what i thought somehow was responsible

until i actually looked at the code lmao

caird coinheringaahing

Luckily it doesn't do that :P

hyper-neutrino

oh. no, that would be weird :p

Unrelated String

my head is feeling so fucking weird

hyper-neutrino

it would be nice if dyadic_chain and monadic_chain were next to each other so i could scroll between them

instead of having the entire file alphabetically sorted ಠ_ಠ

Unrelated String

12:50 AM

sure would

hyper-neutrino

alright that's it i'm forking jelly

Unrelated String

i feel like the way to structure is
use multiple files, partitioned logically
within files, order logically
if there's no logical order within a logical group, alphabetize

caird coinheringaahing

@hyper-neutrino The worst part is: it's not even fully alphabetised

Unrelated String

...

caird coinheringaahing

There are some functions that are just in random places ಠ_ಠ

hyper-neutrino

12:52 AM

wtf

caird coinheringaahing

And output is the very last function (by necessity IIRC, I tried moving it and it broke)

Unrelated String

i wonder if there was an auto-alphabetize feature dennis ran that ended up not running after a certain point

caird coinheringaahing

No, I think it's from more contributors getting invovled

Unrelated String

mmm

reminds me i need to go back and just look at the havoc i wreaked on brachylog's transpiler when i added declarative write

> Restyled comment no longer consumes transpile

oh yeah

OldSandboxPosts

Sandbox posts last active a week ago: Is this an ordinal transform? [code-golf] [math] [decision-problem] [integer]

hyper-neutrino

1:00 AM

ok so i replaced the 5 with a 1 and printed out every single evaluation stage

and the result make no sense :p

caird coinheringaahing

Ooh nice, I'm only 3 status-completed answers away from the bronze tag badge

hyper-neutrino

this is my output for the entirety of the failing program (before it segfaults)

-> M/D means it is entering the monadic/dyadic chain function, $M/D #,#,# indicates the chaining rule that just applied, <- M/D means it is exiting the function, and $M TCO means it has tail-call-optimized a monadic sub-chain

it seems that the infinite loop it gets stuck in is: 2,2, recurse into dyad, recurse into a moand from that dyad, recurse into a dyad from that monad, recurse into a dyad from that dyad, and recurse into a dyadic chain that calls the same 2,2, repeat

Unrelated String

ah

New Posts

0

Q: Implement the Torian

The Torian, \$x!x\$, of a non-negative integer \$x\$ can be recursively defined as $$ x!0 = x \\ x!n = \prod^x_{i=1} i!(n-1) = 1!(n-1) \times 2!(n-1) \times \cdots \times x!(n-1) $$ The Torian is then equal to \$x!x\$ for a given \$x\$. This sequence begins \$0, 1, 2, 24, 331776, ...\$ for \$x = ...

code-golf math

caird coinheringaahing

Brownie points for beating my 11 byte Jelly answer, which may or may not have caused a great deal of discussion around recursion in Jelly in TNB :) — caird coinheringaahing 7 secs ago

@cairdcoinheringaahing Correction: 10 bytes :P

hyper-neutrino

1:19 AM

same solution @caird?

caird coinheringaahing

No, interesting

hyper-neutrino

hmmm. this happens every time :p

what's the md5 of yours?

caird coinheringaahing

169eadf57d4a19022a42e23d563125fa

Never underestimate my ability to golf your FGITWs :P

This was my 10 byter

hyper-neutrino

oh nice

idk why i didn't think of doing something about that weird } construct :p very often golfable

caird coinheringaahing

Especially when you're finding f(x,x) :P

Let me just swap all the order specific builtins, just to remove a single quick :P

I wonder if anyone will use the alternate method. Doesn't look like it'll be obviously shorter than the standard recursion, but ¯\_(ツ)_/¯

Bubbler

1:26 AM

I think I'm seeing something

New Posts

0

Q: Buzzing Bill's Newspaper: Four letter splits in C++

"Buzzing" Bill is a well respected beaver hard working in his home dam. He was a strong beaver and was able to lift more logs than anyone at the dam. Unfortunately Buzzing Bill's career came to an end in a tragic accident. Being such a prominent figure in his town, the Beaver newspaper wanted to...

string code-challenge c++

Bubbler

Okay, it's 10 bytes in APL

which means it should be much smaller in Jelly :P

caird coinheringaahing

@NewPosts I just realised - I rarely use the "lacks winning criteria" close reason anymore, because most of the time "Needs details" applies 'more' :P

@Bubbler Time to FGITW port my own challenge :P

hyper-neutrino

damn ok 6b

wtf is this lol

caird coinheringaahing

I get what it's doing, but not why it does that :P

rak1507

1:35 AM

oh that's genius

hyper-neutrino

this could be 8 bytes in yuno if yuno worked

since i have three call-this-link quicks and so variadicity isn't a factor

unfortunately there's the "if yuno worked" part to worry about

caird coinheringaahing

The ⁸ is bugging me tbh :P

hyper-neutrino

lol why does this not work

caird coinheringaahing

Because that means "repeatedly run R ×\ times"

¡ only takes last_input if the loop body is a nilad

rak1507

my sleep cycle is so messed up, I have to 'get up' in like 4 hours and I woke up an hour ago from going to bed at around 7pm

Bubbler

1:49 AM

At least it's much healthier than staying up until whatever AM :P

rak1507

yeah true just meant that I couldn't do some stuff last night that I was planning on doing bc I was asleep :P

caird coinheringaahing

2:03 AM

@Bubbler I feel very called out right now, as I post this message at 3am :P

Unrelated String

2:26 AM

i actually feel dead tired despite it only being 10:26

hyper-neutrino

i am either really tired at like 11 or i am still up at 5

Unrelated String

or both

hyper-neutrino

true

xnor

2:43 AM

@LuisMendo I don't have an OEIS account but assume I can make one?

For collaborating on a short paper, sounds good to me, but what does that entail? Writing up a proof? I should warn you I'm on vacation now and might not have much time until a couple weeks from now.

caird coinheringaahing

3:14 AM

@xnor From recent experience, so long as you can "prove" who you are (other online accounts work, I used this profile and my GitHub), it's fine to get an account

Ngl tho, it definitely felt kinda weird to have to "request" an account, rather than just sign up

Bubbler

Yeah, presenting GitHub and CG.SE account was also enough for me to get my OEIS account

lyxal

3:31 AM

Imagine having to verify yourself

Iirc I just provided my email

I mean, sure, it was my school email, but I'm pretty sure that's all I needed

@RedwolfPrograms you have an OEIS account. What did you have to provide for proof of identity?

hyper-neutrino

isn't there a difference between a registered account and a user account tho

lyxal

I assume we're talking about accounts that let you contribute sequences

hyper-neutrino

also i think i am now able to compress/decompress jelly strings by hand lmao (granted, with the dictionary available, but still)

Bubbler

Another proof that HN is an AI

hyper-neutrino

also is there any way to edit your own user page (oeis)

@Bubbler i am flattered that you would consider me an "intelligence"

@hyper-neutrino but more importantly i think i figured out a way to do left-to-right optimal string compression which means you can cache results as you type and do trailing spaces properly (though i think you could anyway, the current script just doesn't do it right)

Unrelated String

3:37 AM

ooh