The Nineteenth Byte

« first day (3288 days earlier) ← previous day next day → last day (1562 days later) »

ATaco

1:51 AM

CMC: Code-bowling, Quine with no repeated bytes

a'_'

No, that doesn't work.

@ATaco HQ9+:ASDFGJKLZXCVBNMQWERTYUIOPasdfghjklzxcvbnmqwertyuiop

ATaco

Technically HQ9+ doesn’t satisfy our Quine requirements

a'_'

You didn't say it has to be a regular quine.

ATaco

I suppose I didn’t, but it’s pretty implicit

(Although HQ9+ does actually have a valid Quine, being Hello, World!)

a'_'

There are 3 l's in the program.

I'm an idiot. I thought this was Hello World.

@ATaco You have to include repeating characters, otherwise you can't encode the source code.

Bubbler

2:24 AM

@a'_' You can use a different "encoding" to get around it (e.g. look at Hexagony quine), though the problem is to choose the right language.

On second thought, I think I know the right language for the job.

@ATaco Gol><>, 256 bytes

Inspired by existing Gol><> quine which already has no repeated bytes

(I guess it's actually 255 bytes, excluding newline)

@ATaco True 256-byter including a trailing newline

7 hours later…

New Main Posts

9:13 AM

Q: Careful copy & pasting

Challenge Your task is to write a program that runs correctly but such that, if you delete any one character, the program raises an error, crashes, doesn't compile, throws an exception, or any similar behaviour in your language. An example of such a program in Python would be from math import ...

code-bowling

New Main Posts

9:54 AM

Q: Given a list of strings find all elements which when any character is deleted are members of the list

For example, given a list of English words boats would be output because oats, bats, bots, boas, boat are all words. Simple Pyhon code example: for w in words: has_all = True for i in range(len(w)): test = w[:i] + w[i+1:] if test not in words: has_all = False...

code-golf combinatorics

1 hour later…

Anush

11:22 AM

hi all

is this chat room quieter than it was this time last year?

John Dvorak

11:52 AM

chirrrrrrp

Anush

Fatalize

12:27 PM

@Anush Activity in TNB is almost at a dead stop

Anush

@Fatalize any idea why?

flawr

politics

Anush

I mean the site still seems busy.

is that an illusion.. is it much less busy than it used to be?

@flawr I definitely prefer to ignore that

flawr

in the last two weeks we had less than 2 challenges per day, that is not much

when beta ended we had more than 10 per day

2 hours later…

a'_'

2:04 PM

I wish I could upvote esowiki pages...

Anush

@flawr what was it this time last year?

Adám

2:21 PM

Announcement: APL Cultivation in the APL Orchard in 9 mins.

Anush

also... if it's politics is that the same for all of stackexchange.com? Or is it worse for CGCC for some reason?

Adám

We are much more of a community here, than many other sites. I think people here have takin it worse than avg.

Fatalize

@Adám We were* :p

Adám

:-(

Anush

2:43 PM

I don't fully understand..isn't the controversy to do with people outside of this community? I mean the bad guys are outside of this community

John Dvorak

2:57 PM

We want to be prepared in case TBG decide to shut the site down... and in the process of us getting prepared, our utility of the site has waned.

Adám

@Anush SE was already less than an optimal fit for this type of site. With the "politics" it was the straw…

Anush

@Adám interesting.

I just really enjoy everyone here! I don't even think about where it is hosted

El'endia Starman

Consider further: StackOverflow was started specifically as "by the community for the community". This remained true as StackExchange became a thing and more sites were spun off. For years, SE put time and effort into supporting communities. Pro-tem mods were nominated by the community and mods, members of the community, were elected by the community. There's a lot of features designed to help communities (SE sites) support themselves and do most of the work.

Adám

@Anush There are various initiatives for finding a new home: Axtell, Codidact, TopAnswers.

Anush

@Adám yes I glanced at one of those

I guess it comes down to money, as always

we will end up with sponsored questions where you can pay money for good answers :)

El'endia Starman

3:09 PM

The last couple of years though have seen explicitly anti-community actions by SE. Firing a highly respected mod of six sites (Monica), firing community managers (Shog9 and Robert) that were the most engaged with all the SE sites, that sort of thing. Many mods, including myself, and users could not in good conscience continue providing value to SE by moderating and such when they are so actively hostile to the health and well-being of our communities.

Adám

@El'endiaStarman And SE was also not very flexible for this community's special needs.

Anush

to be honest, I am not sure how SE makes money

I don't obviously see any adverts

El'endia Starman

SE doesn't make money. SO does. (Well, SO Enterprise, Teams, etc.) That's kinda the problem.

Anush

how does stackoverflow make money?

ah.. those things I have never heard of :)

El'endia Starman

Also, do you have an adblocker?

Anush

3:11 PM

@El'endiaStarman yes.. I never see any adverts :)

just realised I also had my vpn on :) oops

you may not have noticed I changed country

El'endia Starman

Yeah, me too, but adblockers are the minority. Do a search for "ads" on Meta.SE and you'll see plenty of posts about inappropriate ads all over the network.

Anush

so.. back to coding.. can we revisit a question I had before. Let me repose the CMC

CMC Given n uniformly random binary strings each of length 24, give the exact expected minimum Hamming distance for n = 2....

the answer is 12 for n = 2 :)

answers in Julia get extra points :)

(My new favourite language as of 24 hours ago.. so I still know nothing of it)

Kritixi Lithos

3:33 PM

@Anush will finite automata solve this problem too? :)

Anush

3:44 PM

@KritixiLithos A great question! Can I pretend I know the answer ? :)

for n = 3 it is doable :)

Kritixi Lithos

"How to compute the expected minimum Hamming distance with 3 strings" math.stackexchange.com/q/3523712/295588

Anush

@KritixiLithos That's not an exact answer!

Kritixi Lithos

4:17 PM

easier cmc: solve for n=3

Anush

4:42 PM

CMC Given 3 uniformly random binary strings each of length b = 1..., give the exact expected minimum Hamming distance.

@KritixiLithos also fun :)

Neil

5:05 PM

CMC: Output a limiting arbitrary-precision integer. This must be an integer that converts into +/-Inf, but the integer 1 less/greater does not, or vice versa. Snippets allowed. Extra brownie points for writing verification code.

2 hours later…

Neil

6:48 PM

(converts to ieee double, I meant)

Anush

hmm.. more questions than answers it seems here :)

dzaima

7:32 PM

@Neil dzaima/APL, +/2*970+⍳53

not pushed to github (for a while now because it should probably be of different syntax/name) is ⎕CONV to convert to/from a bigint version of the raw bits of a double, so 1∘+⍢⎕conv +/2*970+⍳53 (increment under raw number) gives infinity

-∘1⍢⎕conv÷0 (decrement under raw of 1÷0) is of the same size

2 hours later…

dzaima

9:13 PM

@Neil oh, misunderstood the CMC; dzaima/APL, ¯1+-/2L*1024 970 (TIO doesn't have dzaima/APL's bigints)

as for verification, 0 1≡ (÷0)= ⍎¨¯1↓¨⍕¨ 0 1+ ¯1+-/2L*1024 970

chx

9:34 PM

So .. accepting answers. I read codegolf.meta.stackexchange.com/q/8706/7733 and I obviously will wait for a bit but right now I feel like codegolf.stackexchange.com/a/198680/7733 especially in light of codegolf.stackexchange.com/a/198661/7733 should be the accepted one. Is there any problem if I don't accept the ... how to say ... right answer?

Adám

@chx No, you can accept whichever one you want, or none, and you can always change your choice later.

chx

Thanks. I usually know my way around SE , I am like top 20 on travel SE, been on SO for oh god, i can't be that old :P but codegolf is a bit different.

dzaima

@chx generally you must accept the answer winning by the criterion (though it's much more common here to not accept anything)

chx

alright then i will just leave a comment.

dzaima

(for reference, this answer is at +24/-3 but this is at +14/-10)

chx

9:42 PM

well then golfing languages would always win

dzaima

@chx hence why it's common to not accept any answer at all.

chx

got it

2 hours later…

New Meta Posts

11:52 PM

Q: What is too many sandboxed challenges?

I am very enthusiastic about this community (but I am very very young here) and I really want to contribute with new challenges. On the other hand, I don't want to "clog" the sandbox with challenges I propose. Would you say there is a limit on the number of challenges I post on the sandbox? Or w...

discussion support

« first day (3288 days earlier) ← previous day next day → last day (1562 days later) »

all rooms

Transcript for

Jan29

Jan '2030

Jan31

The Nineteenth Byte: General discussion for codegolf.stackexc...

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC