Agemixer (23:49:40)
correction: conditional programming

mirrorbird (23:49:27)
we are very complicated machines but very efficient.

Agemixer (23:49:24)
if [not true] then jump to [this]+n bytes

mirrorbird (23:49:02)
they were studying it because it could outperform the best known algorithms. Nature is wild.

mirrorbird (23:48:48)
there was sth interesting in the news not long ago, about the study of some biological thing, a fungus? which grows very efficiently towards its goal (food...)

Agemixer (23:47:58)
or yeah, if you want to skip a piece of code, then that is called proportional code, iirc

mirrorbird (23:47:53)
could be like a NOP

mirrorbird (23:47:48)
JR 1 then

mirrorbird (23:47:43)
hmm actually maybe JR 0 would be an infinite loop. that's like 'goto self'. again: don't know, never writ z80 except tiny copy routines n stuff

Agemixer (23:46:32)
Hmm, yeah the list of jump pointers is another approach for it

Chucky the Unlucky

C-jeff (Dmitry Zhemkov)

latter

Time Left: 2:51