Timeline for Generating Brainf*** NOPs
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 7, 2015 at 23:25 | comment | added | LegionMammal978 | @MartinBüttner Also, RepeatedTiming gave me an average of 8 seconds. | |
| Dec 7, 2015 at 22:34 | comment | added | Martin Ender | Sadly, that might be shorter in CJam than my current solution. | |
| Dec 7, 2015 at 22:14 | comment | added | LegionMammal978 | @MartinBüttner Yes. On average, I would say that it takes about 5 seconds. At first, I tried completely random programs, but it never terminated for length 100. | |
| Dec 7, 2015 at 22:07 | comment | added | Martin Ender | does that actually generate a valid no-op of length 100 in under a minute? | |
| Dec 7, 2015 at 22:00 | comment | added | LegionMammal978 | @MartinBüttner Fixed... Currently, it just generates random programs with an equal number of +-- and <-> pairs until one happens to be a NOP. Half of it is taken by a simple BF interpreter. | |
| Dec 7, 2015 at 21:56 | history | edited | LegionMammal978 | CC BY-SA 3.0 | added 10 characters in body |
| Dec 7, 2015 at 19:57 | comment | added | Martin Ender | How exactly does this work? If I call the function with a number it only returns +. | |
| Dec 7, 2015 at 15:53 | comment | added | Martin Ender | Would you mind adding an explanation, so people can actually convince themselves this is valid? :) | |
| Dec 7, 2015 at 13:26 | history | edited | LegionMammal978 | CC BY-SA 3.0 | added 1 character in body |
| Dec 7, 2015 at 13:20 | history | answered | LegionMammal978 | CC BY-SA 3.0 |