User talk:Blashyrkh

Hey, you make some cool stuff!!! Would you perhaps collaborate with me on an esolang? --Yayimhere2(school) (talk) 15:23, 8 January 2026 (UTC)

Which particular "cool stuff" do you mean? --Blashyrkh (talk) 15:35, 8 January 2026 (UTC)

Crazy J, aswell as your BF kolakoski sequence --Yayimhere2(school) (talk) 15:38, 8 January 2026 (UTC)

Ah, I see. And I see your sphere of interest is HUGE, you've created a lot of esolangs. I'm not sure about collaboration at the moment, newyear holidays is almost over, I've got only a couple of days to finish with Crazy J (QUINE should be the perfect last nail to this coffin). --Blashyrkh (talk) 15:52, 8 January 2026 (UTC)

K thats fine! Would you perhaps want to if you eventually get time? --Yayimhere2(school) (talk) 15:54, 8 January 2026 (UTC)

Never say never. Why not, 'll be glad to. I also have an idea for esolang that I can't implement at the moment (and it requires some research and/or bruteforce search anyway). If you're interested, I'll create a page and describe the idea there, and you feel free to elaborate and implement it if you wish. --Blashyrkh (talk) 16:00, 8 January 2026 (UTC)

Sure! thanks --Yayimhere2(school) (talk) 16:04, 8 January 2026 (UTC)

User:Blashyrkh/UnnamedEsolang --Blashyrkh (talk) 16:40, 8 January 2026 (UTC)

I dunno if im the biggest fan of the language but I guess why not. Would it be fine if I like changed the language? a little bit? Because I have been having some other ideas for esolangs recently. Also I cant find -1 nor / lol --Yayimhere2(school) (talk) 16:46, 8 January 2026 (UTC)

For me functional programming was a real shock after almost 30 years of imperative languages (C/C++ mostly). It's like relocation to other Universe with non-Euclidean geometry. If you didn't try, you certainly should. Read this: https://en.wikipedia.org/wiki/Church_encoding and this: http://www.madore.org/~david/programs/unlambda --Blashyrkh (talk) 16:54, 8 January 2026 (UTC)

I know what functional languages are, I just cant find any info on / nor negative one --Yayimhere2(school) (talk) 16:58, 8 January 2026 (UTC)

I meant "predecessor function" (x-1) and "integer division" (x/y). --Blashyrkh (talk) 17:01, 8 January 2026 (UTC)

Ah ok. Imma ask those to the page to not confuse ppl --Yayimhere2(school) (talk) 17:02, 8 January 2026 (UTC)

new esolang i made

Check out Bracky, its basically based off ((()))(((())))=5 but its better, far better. YOU CAN GET MULTIPLE LINES OF CODE!!!

Crazy J

Hi! Can you please put the CC expressions of the combinators in Crazy J? For example, T=JII instead of ``jii. I put a few of the simple examples in the table. Your notation can be hard to read for the more difficult expressions. Please put the CC expressions for the more complicated combinators. Thanks. Bobby Jacobs (talk) 12:58, 5 June 2026 (UTC)

I see you've done it yourself. You're welcome ;) --Blashyrkh (talk) 14:19, 5 June 2026 (UTC)

Between IJ and SK

Please put the regular combinator formulas of the cancellative combinators in the table in User:Blashyrkh/Between IJ and SK. For example, Xxy=y in lieu of 000010. They are easier to understand than the BLC syntax. Thanks. Bobby Jacobs (talk) 18:43, 19 August 2026 (UTC)

In fact, I abandoned that research because User:PkmnQ proved that there are actually bases more potent than IJ and still incomplete (e.g. IJ(YK)). Are you sure it's worth continuing? --Blashyrkh (talk) 19:00, 19 August 2026 (UTC)

I'm looking at it again and now I'm wondering what the smallest counterxample would be, and if there's one that doesn't require the usage of some Y or ω-like trick. –PkmnQ (talk) 03:31, 23 August 2026 (UTC)

w/o Y and ω-family you could just apply it to a bunch of linear combinators and put the variable in the place where the argument is ignored to get an affine combinator, so I conjecture there's nothing as a counterexample without ysing Y and ω.Cleverxia (talk) 04:13, 23 August 2026 (UTC)

I almost proved that any proper cancellative combinator is enough for IJX to be complete (stroked out text at User:Blashyrkh/Between_IJ_and_SK). But some arbitrarily taken non-proper ones were ok too. So, I wonder how you guys would define a "Y or ω-like trick". --Blashyrkh (talk) 07:10, 23 August 2026 (UTC)

iota

Maybe we should add iota to the combinatory logic tables. by the way, where is your brute forcer located at? Cleverxia (talk) 02:05, 23 August 2026 (UTC)

iota is there, at the last row of the table. I was thinking about adding Tromp's alpha and my beta and gamma there, but not sure, they are not very known. Which brute forcer do you mean, I made a lot of them? --Blashyrkh (talk) 07:10, 23 August 2026 (UTC)

well I meant the columns, not the rows. that is, list the shortest iota reperesentation for each of the combinators. For the bruteforcer, anyone should be OK Cleverxia (talk) 08:16, 23 August 2026 (UTC)

We discussed it already at Talk:Combinatory_logic#Table_of_common_well-studied_combinators_-_other_bases?. The table would look ugly with more columns, especially on mobile devices. Ok, we'd add iota, then we'd add SK (without I), S'KI (Bobby Jacobs's "converse starling", see Talk:Combinatory_logic#The_bird_S') and S'K, then "converse iota", then Tromp's Alpha, then my Beta and Gamma... And the table would become unreadable.

My bruteforcer for "between IJ and SK" problem is at github, the link is at the dedicated page. Here is it. --Blashyrkh (talk) 08:28, 23 August 2026 (UTC)