The Nineteenth Byte

« first day (3241 days earlier) ← previous day next day → last day (1897 days later) »

New Main Posts

00:34

This challenge is from a game called Keep Talking And Nobody Explodes. Memory is a fragile thing but so is everything else when a bomb goes off, so pay attention! – from the manual The Objective A number from 1–4 is given as the "display", along with scrambled numbers 1–4 as the "buttons." Th...

A̲̲

00:54

I had a dream that I got downvoted to 230 reputation. I overheard that other users have had the same problem before, and after some discussion, their downvoted reputation went back to normal. (I can't remember what I did after that; maybe I deleted my account?)

2 hours later…

Jo King

02:42

@mbomb007 They fixed a bug in the announcer query, so there were hundreds of badges awarded

PhiNotPi

I received a long-overdue Publicist gold badge (and the unicorn hat to go with it).

6 hours later…

A̲̲

08:58

(I hope nobody read my nonsense)

2 hours later…

flawr

11:26

@A̲̲ In that case I suggest not posting it in the first place

(works very well)

@PhiNotPi nice, I was really confused about your picture until I noticed it was a hat:)

A̲̲

@flawr (, ironically)

4 hours later…

New Main Posts

15:45

Q: Pass on your radiation

The task here is pretty simple. You should write a program that takes a string as input and outputs it (that is a cat program). Additionally when the \$n\$th byte of your program is removed (without replacement) the augmented program should take a string as input and remove the \$n\$th characte...

source-layout radiation-hardening self-referential

Redwolf Programs

16:13

@dzaima And with infinitely tall programs, it's impossible to initialize at all...

Oh wait, that's actually an issue.

They'll never run in a finite amount of time. They'd have to be infinitely wide.

dzaima

@RedwolfPrograms you just have an infinite drop for a zero in one place getting branched where needed, and since everything travels down at max 1 unit per tick, it's guaranteed to be there before anything else (assuming that "else" is delayed enough, the delay being height-independent).

halting may be an issue, but that doesn't really matter (i.e. you could make outputting -1 halt)

also, looking at your source, what is the Math.random for?

Redwolf Programs

16:36

But in an infinitely tall program, the packet could never reach the actual logic in a finite amount of time. I guess that would count as an implementation detail, though, maybe. The random is for when a packet is pushed into either side of a storage unit at the same time. It technically doesn't matter though, since it's impossible to read from it in that case

dzaima

@RedwolfPrograms my point is the zero packet could reach whereever it's needed before anything else due to the speed of transfer being unbeatable. The packet won't reach everywhere in a finite time, but it will reach everywhere it could possibly affect anything

e.g. if you're 100 steps in, you don't care that there isn't an initialization zero 1000 units down, because there won't be any other packets there either

Redwolf Programs

Makes sense, I guess the -1 feature isn't necessary

dzaima

it'll definitely allow for much more performant infinitely tall programs though (do you have plans for making an interpreter allowing for those?)

Redwolf Programs

I don't know, maybe eventually. I guess storage is different enough from other units that it needs the -1 feature

ngn

17:31

cmpc (popularity): think of a cool 256-bit (or 4*64-bit) nothing-up-my-sleeve number. ideally something playful so hackers like it, original (not: the leading bits of pi or e), and simple enough so any programmer can get it from a single-sentence explanation

Kritixi Lithos

@ngn chaitin's constant of some not-too-golfy language

is there a code-golf challenge that asks to write a program for which its halting status is not known, akin to codegolf.stackexchange.com/q/111092/41805?

ngn

@KritixiLithos cmpc amendment: the nothing-up-my-sleeve number must be computable :)

Kritixi Lithos

if you choose a language with the right conciseness/verbosity, you can get a bunch of people manually go through each possible ≤64b programs and hope no unsolved problems reside within

ngn

@KritixiLithos i need 256 bits of entropy

dzaima

17:52

@ngn y'know, it's hard to "make" nothing-up-my-sleeve numbers :p

ngn

@dzaima or maybe easy to make but hard to test what people have up their sleeves :)

wizzwizz4

@ngn The first non-negative integer n satisfying n % 2*3*5*7*11*13*17*19 == n**2 - 2**n + 3**n == 0.

ngn

@wizzwizz4 0?

wizzwizz4

@ngn There's no way I could've got that from a secret backdoor that nobody else has.

Therefore, it must be safe to use.

ngn

lol :)

dzaima

18:11

@ngn the parity of the first 256 unique numbers of the continued fraction of pi

ngn

@dzaima that's a good one

ngn

18:23

i like this one too: the central column of rule30. its even simpler to compute than the cfrac/digits of pi, though probably not as famous

Adám

18:51

@mbomb007 Not that I know of. We have had code golf workshops as part of our conferences in 2017 and 2019. during the 2017 conference, Optima Systems also ran live competition, which was so popular that they ran another one during the autumn.

New Main Posts

19:11

-1

Q: Create a book shop program using code

You are being asked to create a book ordering system. Your book ordering system must include following function: 1. User must be able to enter book title (Set the limit of 100 for books. User press enter again for end of book) 2. User must be able to enter book price 3. User must be able to di...

atomic-code-golf

Newly Featured Questions

19:45

Q: Cycles in run-length encoding

Consider some binary sequence, using 1 and 2, e.g.: 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1 ... Let's write down the run lengths of that: 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1 ... _ _ ____ ____ _ _ _ ____ 1, 1, 2, 2, 1, 1, 1, 2, ... In this case we happen to get another binary sequen...

code-golf number sequence

New Main Posts

20:13

Q: Check if simple regex matches string

A simple regex is either: _ (which matches the empty string) Any lowercase letter a to z (which matches that letter) r*, where r is a regex (which matches r any number of times) (r|s), where r and s are regexes (which matches either r or s) (r+s), where r and s are regexes (which matches r foll...