Skip to main content
16 events
when toggle format what by license comment
Jun 20, 2018 at 7:14 comment added Esolanging Fruit This challenge is effectively just "write a Smallfuck implementation and find all programs that halt after at least G steps, where G is the largest constant you can fit under 1000 bytes."
Jan 15, 2018 at 0:42 comment added Esolanging Fruit @user75200 "For the purposes of this challenge, a program that moves left from the start of the tape is considered invalid."
Jan 13, 2018 at 18:03 comment added user75200 For n=3 assuming 2-way unbounded tape, we get <[] as well.
Oct 9, 2017 at 2:17 history edited Esolanging Fruit CC BY-SA 3.0
Put the testcases in an easier-to-use format (and put them in lexicographic order for some reason)
Jun 14, 2017 at 17:42 history edited Esolanging Fruit CC BY-SA 3.0
deleted 3 characters in body
Jun 13, 2017 at 8:01 history edited Esolanging Fruit CC BY-SA 3.0
added 20 characters in body
S Jun 8, 2017 at 14:10 history mod moved comments to chat
S Jun 8, 2017 at 14:10 comment added Dennis Comments are not for extended discussion; this conversation has been moved to chat.
Jun 6, 2017 at 18:23 answer added PunPun1000 timeline score: 6
Jun 6, 2017 at 16:42 history edited Esolanging Fruit CC BY-SA 3.0
added 3 characters in body
Jun 6, 2017 at 7:54 answer added Mayube timeline score: 2
Jun 6, 2017 at 7:22 history tweeted twitter.com/StackCodeGolf/status/871990541692661760
Jun 6, 2017 at 5:07 history edited Esolanging Fruit CC BY-SA 3.0
deleted 67 characters in body
Jun 6, 2017 at 2:33 history edited Esolanging Fruit CC BY-SA 3.0
added 1 character in body
Jun 6, 2017 at 1:42 history edited Esolanging Fruit CC BY-SA 3.0
deleted 1 character in body
Jun 6, 2017 at 1:35 history asked Esolanging Fruit CC BY-SA 3.0