@thejonymyster ARBLE, 17 bytes char(44-a/abs(a)) Outputs , for 0

It explicitly does work for strings too

That is a fun idea for a popcon

I would've gambled and posted directly like I normally do, but Pop-cons are cursed

yeahh

@ATaco 90% of challenge askers use the sandbox right before they would have hit it big posting straight to main

Is there physical brainfuck interpreter? Can find a huge bunch of digital implement but

There's a Minecraft one, but building one might be a first

got a "smart" 27-byter in Jelly for this and it's kinda painful to realize just HOW MUCH logic it has for something that FEELS so elegant

might post in the morning but I've already probably been up a whole hour longer than I meant to be staring it down 😭

(this) is the solution if anyone else wants to try

neat :3

thanks lmaoooo

Like, it basically has to check THREE separate rules on the cumulative sums by column when sliced by a candidate flock size--don't exceed max state when flattened, flat sum equals flock size, last row is all 0--and then also special case k=0 on top of that

and Jelly is kinda not the best at chaining that logic but I've still managed to do that part way better than I'd expect :P

*cumulative sums of the signed differences, using Jonathan Allan's lexicographic max minus min trick

Stack Exchange user tries to reinvent the wheel, pictured 2024

@l4m2 Would a brainfuck interpreter on a FPGA count?

@mousetail'he-him' no

no electric

brb writing an analytical engine brainfuck interpreter

@rydwolf something tells me you'd very much enjoy reading midnight's simulacra by Nick Black

There is a LEGO Turing Machine, not quite brainfuck but similar idea: ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7

I imagine a "Brainfuck" toy for kids would be hard to market

@UnrelatedString the rationale on this was that a post by a deleted user (or a deleted post) should not have been promoted to begin with, so they intentionally remove the points you get to disincentivize editing spam to get free points

or they just couldn't be arsed to not use cascade in their sql query

Since a event is generated for the rep loss I think it's safe to say they didn't simply forget not to cascade

@l4m2 A physical brainfuck compiler could be even more interesting, a machine that builds a machine that runs the given BF

Is there a physical Turing machine that is simple (finite) and take infinite tape?

@l4m2 i feel like this would be trivial given you can make a turing machine using de-glorified punch cards

like it wouldn't be hard to make this in real life youtube.com/watch?v=uNjxe8ShM-8

Is Turing machine or queue machine easier implemented?

For a physical machine, I imagine queue would be harder since it's hard to change the size of a physical ring-like structure

Assuming a theoretically infinite queue size, otherwise you can simply use a stack of tokens and drop tokens on the top

queue would use soft tape

Soft tape?

paper

How would that let you extend it?

and it can be once written, need not recover

That's true

But the machine would need to read from one part of the paper and write to a different, possibly very far away, part of the paper

Or possibly very close, the read and write heads can theoretically be in the same place, so putting a spool in the middle is also not an option

@rydwolf why is this not a regular thing in schools this sounds epic

@Redz possibly because schools are terrified of liability and LN2 isn't exactly the safest thing there is

i find it odd how terrified of liability schools actually are

like yes obviously don't put the kids in completely insane situations but the dial seems to be "do nothing ever"

hello!

CMQ Number of binary n by n matrices where every row has at least two ones and all rows are distinct

At my university they had a yearly tradition of throwing all first year mechatronics students into the river, but stopped after a student broke her back sadly

@mousetail'he-him' spoil sport!

how did they break their back going into a river? Did they miss the water?

Landed wrong I guess

Each group had to build a bridge over the river (the river is tiny). Then they'd load all the team members and then concrete blocks on each bridge till it broke. The more weight your bridge could hold the better your score.

Eventually everyone ended up in the water

it does sound like a lot of fun

can you say which uni?

TU/e

cool!

I have been trying to find places online with active chat rooms for tech stuff

maybe discord is the answer... ?

Discord has a lot of such groups for sure

I can send you some discords if you are interested

yes please!

I find it very hard to navigate

A discord for a python youtuber that I moderate: discord.gg/dBxFFHyBct

CGSE discord: discord.gg/6zpjKExMhe

thanks!

what does moderate mean here?

I kick spammers

ah ok

And sometimes intefere when a discussion gets too heated though I'm not that good at that

how bad is that problem?

Significant, we get one every other week or so

are you paid?

Nope

just for the love of it?

Just for the power trip /s

When I started they where still a very small youtuber that I was happy to support. Now they are a bit bigger and do have some paid staff but since I'm just spending a few seconds kicking a spammer every few weeks I don't really mind

The people on the server, particularly Dale, are nice. It's a good community

sounds very cool. I just learned about bytestrings this week. There are so many obscure corners of the language

I use those all the time

why do you use them?

For reading and writing binary files

ah ok. I am only using them to save space

For example, recently I wrote if f.read(4) == b'APNG': to check if a file is a PNG

got you

mfw I open powerpoint instead of postman

@lyxal good news! chat.stackexchange.com/transcript/message/66758875#66758875

I don't need turing complete I need post requests :p

Might need to touch Visual Basic macros to do that from PowerPoint

good news! stackoverflow.com/a/63414691/7611125

...

I'm not sure that's good news

How insecure was that website? The answer doesn't give mich away about the security

addNew doesn't seem to require any authentication

I mean, it's an add high score url

if you look in the answer revisions you can see the url history

Yes I did see that

But adding a score shouldn't let you delete files

with an input control scheme like that I imagine the hack was done out of frustration

that's a very annoying ahh game

@mousetail'he-him' possibly a DELETE request?

There is no reason to think the server supports it, it's not a common verb outside WEBDAV

i guess that's fair enough

we may never know

they should have called it Web Distributed Authoring and Versioning Extensions

the extra "Extensions" at the end really adds value to the name

WebDAV is a weird technology.

wouldn't be so weird if it were WebDAVE

just saying

greatly missed oppurtunity

It's so intertwined with HTTP standards yet also using HTTP things in weird ways

WebDav doesn't violate the HTTP standard conventions only because all of them make explicit exceptions for WebDAV

@Themoonisacheese Ahhh, that definitely does make sense--I'm surprised the rep gain isn't tied to who accepted the edit instead, but then that would require more discretion in review queues about not accepting edits on bad posts and be harder to crack down on abuse of, not to mention it's just such a small rep gain in the first place that it's not worth going to extra effort to safeguard (and my specific edit was accepted by Community instead of anyone in particular)

Yes, I think if it's two different people then it's community

@Simd choose(n,(n^2)-(n+1))

for each n, the number of valid rows is n^2 - <number of rows that popcnt ==0 or 1>

that number is n (popcnt 1) +1 (all zeroes)

@Themoonisacheese choice needs n to be bigger than (n^2) - (n+1) doesn't it?

maybe this isn't the right term in english

in france i was taught that choix(n,k) (lit choice) is a function that counts all possible permutations of n element from a bag of k distinct elements

veyr much related to the statistics analogy of picking elements from a bag of course

ah, k choose n in english

maybe not, wolfram alpha seems to give nonsensical results

It's n choose k normally

foiled again by the french education system

your bag has n^2 - n+1 elements in it, and you pick n elements from it. there.

for small n of course n^2 - n+1 can get negative or smaller than n, but that just means you don't get enough distinct valid rows to fill n rows

(actually i think n choose k is too small for your oginial query, because i'm quite sure it doesn't distinguish order, just what combinations you can get

not sure though)

17 other people have signed up to rizz themselves

amazing

What does rizzing yourself even mean? Is that like one of those motivational tapes?

group therapy

@Themoonisacheese very fair actually

@mousetail'he-him' I asked my gen alpha friend and they said yeah, self love

thanks vscode

On this day, in 1968: The Mother Of All Demos en.wikipedia.org/wiki/The_Mother_of_All_Demos

@l4m2 i actually managed to design one, was planning to build it but got stuck on loading a 16 bit address into an 8 bit register

What did you design it in? Do you have a partially working design that you can share?

a notepad

Can you mail it to me?

idk if i can even find it by now lol

lemme check rq

nope

sorry :/

it was on those kinds where the paper is easily ripped away, presumably someone saw my circuit diagrams and decided that its too gibberish and just threw those pages away to use the notepad themselves

printf 'dir='\''%s'\''\n' "${dir//\'/\'\\\'\'}" >> "${dir}/close"

I love bash

(I'm writing a bash script that generates a bash script which includes an arbitrary path)

hm yes

well, they posted an answer

can't say it's surprising

@rydwolf I have had a vision

you know that one wordle clone with minecraft blocks/items

what if that but with modded content

or maybe just with mods

That would be super cool

I have no clue how it would work in a way that isn't just... impossible

it would need to only use mods that are popular enough to have wide recognition

and you'd need more interesting things than "blast resistance"/"hardness" - no one knows what those values are for vanilla anyway

A stupid one would be crafting recepies

lmao real

okay. worse idea

infinite craft, but the model is trained on textures and item names from Modrinth

@UnrelatedString [plays Uno reverse card on the buzzer] Your solution produces outputs like -_=- which is incorrect. ;P But it's an interesting approach--there's probably a way to make it work.

I think this should do the trick: (($3=!())(-{#5}!-?)$4*(_{1-#4})+){2,}

@DLosc oh 😭

@DLosc But nice!

@Ginger well hey it's finally public :p

We should ask them to add an Answer Bot on CGCC /s

CMC: sort a string of uppercase/lowercase letters alphabetically, with uppercase before lowercase

i.e. helLo -> ehLlo

Feel like I've seen this before but not on main, but I also don't feel like I've seen it as a CMC before so ???

anyways fun

¯\_(ツ)_/¯

Œl,$Þ is the obvious 5 in Jelly

sµ⇩ in vyxal i guess

sort, sort by lowercase

ahhh, that would be a little simpler yet :P

ṢŒlÞ in Jelly

we love forgetting that iterating stable sorts is similar to sorting lexicographically

Vyxal 3, 4 bytes: µʀ|z Vyxal It Online!

sort, sort by lowercase is shorter

but I wanted to use a more principled approach :p

and to use the sort by <x> then by <y> feature of sorting lambdas

it's "sort by lowercase" then "break ties by is lowercase"

that is kinda neat tbh

can't it just be µʀ|

guess it can

yeah

you can do a similar thing with maps and filters

multiple branches in a map lambda "refocuses" what's stored in n

like that funny monadic chain separator in jelly

multiple branches in a filter lambda act as a filter by x, then by y, then by ...

saving having to close the lambda if you want to do multiple filters in a row

that is kinda neat :p

@lyxal Ooooooh, nice

see my language design ideas aren't all that bad

I can actually come up with good ideas every now and again :p

so µ behaves like µ⟨ now

I suppose so yeah

didn't realise that's how it worked lol

Is that not how it's implemented under the hood?

...no

like I said, principled :P

as in, is sorting by [c1, c2, c3] not how it's implemented

maybe it is

val out = iterable.zipWithIndex
          .sortWith { (a, b) =>
            branches.view
              .map { branch =>
                val f =
                  VFun.fromLambda(AST.Lambda(Some(1), List.empty, List(branch)))
                (
                  f.execute(a(0), a(1), List(a(0))),
                  f.execute(b(0), b(1), List(b(0))),
                )
              }
              .find(_ != _)
              // If they compare equal with all branches, a < b is false
              .fold(false) {

certainly seems to be creating a list of values from each function

@emanresuA it would appear it's doing that with extra steps

.fold(false) {
                case (aRes, bRes) => MiscHelpers.compare(aRes, bRes) < 0
              }

it's sorting by is there any instance of sorted values where corresponding results is <

interesting

at least I think that's what it's doing

no clue what that .find(_ != _) is doing

also, given that the sort lambda is really just lambda ... } sort-by, λ|ʀ|z}ṡ also works :p

because λ|ʀ|z} is a multi-branch lambda

ṡ is capable of doing stuff with the extra branches