@noodleman And the distance between Pittsburgh and Philadelphia is several times bigger than the distance between Philadelphia and New York, so the commute would be way worse for Pittsburgh
i mean to be fair when i say "not easy" i don't mean that the commute itself is that hard —it's bad, but reasonable. just doing it every day would be insane
I'm not lyxal, but we probably want to at least: - compare TNB message density of the last three weeks to TNB and TNB+TST message density of the three weeks before (and maybe see if other rooms were affected) - Do a general poll on how people feel about how it's changed TNB's atmosphere
I kinda want to see how often conversations were interrupted during this period (vs before) and how often there were multiple conversations going on at once, but that would be a lot of work. Anyone else feel like doing it? I can give you a +50 bounty
(sidebar: I love thumbs ups so much. It's so versatile as an emoji reaction, and it works great in real life too (although I guess versatile -> ambiguous sometimes))
Trying to look at individual conversations is tricky and there might be a bit of inherent bias based on what whoever's doing the analysis wants to show
Personally I'll be focusing less on stats and more on whether TNB is still enjoyable for the majority without tst
Because the main point of the experiment was to see if TNB is too unruly without the sand trap
or whether it's plausible to have just one room with more moderation if needed
That's how the meta post is worded
(the original one)
And I'll be asking whether having everything back in here was an enjoyable experience
Like did people enjoy having updates about general life stuff, were there times went people felt like a conversation should have been moved but felt they couldn't say so, etc
like is the n-bit slice fixed relative to a notional head like in a normal tm, where that single head position controls the only cell it can write to, and can only move one cell left or right at a time?
i feel like for n=3 that should have a relatively straightforward construction from normal tms where you interleave tape symbols that are reserved for corresponding to states
but i'm too tired to get all the details straight lmao
might need some extra bit in those state symbols to make the bidirectionality work
After that, I'm thinking next steps is, if it's determined that the freeze experiment was "successful" (e.g. received well, had good impacts on TNB), looking into freezing TST permanently.
and then investigating ways to prevent noise concerns that don't involve making a dedicated off-topic chat room :p
- all stacks are read-write - functions have their own stack - take pops one item from the parent stack and pushes it to this stack - take at the top level reads an item as input - switchpush pops three items, and pushes the second if the first is truthy else the third
I have written (in Kotlin) a parser for this language
apl traditionally represents strings as vectors (and matrices) of characters and it's a somewhat common "extra feature" dialects add to have a scalar string datatype
@Ginger yeah, i wanted to learn kotlin but my laptop isn't powerful enough to run idea and going through the tutorials without a good editor was annoying
i was considering using Uiua for the compiler but i decided against it just because i don't feel like dealing with stack shenanigans the whole way through
I think it's actually open-source, but doesn't work outside of IntelliJ
> The Kotlin AST has a built-in repair API, which seems to be how IntelliJ works, but as far as I can tell this API does not work if the surrounding IntelliJ machinery is not present.
completely unrelatedly: i think a major power of stack-based programming that i think golfing languages have largely missed is that functions can have multiple outputs
of course they all use it to an extent (e.g. flip, over) but i haven't seen it used fully
i only realized this after using uiua and wanting to add multi-output functions to my language and realizing i basically couldn't without adding a stack
@RubenVerg Yeah, the fact that there's an actual top type and everything's treated as an object instead of there being primitives is great. Also, companions > static
For the purposes of this challenge, a 1-2-3 sequence is an infinite sequence of increasing positive integers such that for any positive integer \$n\$, exactly one of \$n, 2n,\$ and \$3n\$ appears in the sequence. There exist multiple such sequences, so any one will suffice.
Your challenge is to ...
I really need to make some irl friends who are into the same things as I am so I can monologue at them and they can monologue at me about how amazing Scala is and how awful Python is and whatnot
I think part of why Vyxal prefers single outputs is that if an element is given a specific arity, we assume it has 1 return value. If you want to say that an element has any number of outputs, you need to not give it an arity, but that also means it could have any number of inputs, which makes it a bit more annoying
I do think Factor takes advantage of this though. A lot of the function signatures (stack effects?) I saw in the docs when I was trying it had multiple outputs
Oh your point was literally that golflangs have missed out on it, sorry
my idea: For a number n in the list, remove 2n and 3n. At least the double of 3n and the triple of 2n appears in the list, 6n. Remove 4n and 9n from the list.
pretty simple, I think it works
Initially I just thought 4n and 9n would get removed by the process, but uh for most cases they won't.
@mathscat yeah that looks like it gives the list I was working on, which is if n is in the list, then so is 6n, 8n and 27n, plus all numbers coprime to 6 are in the list
