Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.

 Tweeted twitter.com/#!/StackCodeGolf/status/532725551316746240 occurred Nov 13 '14 at 2:44 4 added 532 characters in body edited Oct 27 '14 at 6:14 marinus 30.1k66 gold badges6262 silver badges109109 bronze badges Edit: I had originally intended for generation 0 to be the input word itself, and generation 1 to be the result of the first step. I.e., I had intended for you to return the before column. However, as I have not been clear enough in stating this, I will accept both options; for each generation you may return the value in either the before or the after column. You must state that you are following the after column, if you are doing so. You must also be consistent in which column you choose. I will award the smallest code a week from now (10/27/2014). Edit: I had originally intended for generation 0 to be the input word itself, and generation 1 to be the result of the first step. I.e., I had intended for you to return the before column. However, as I have not been clear enough in stating this, I will accept both options; for each generation you may return the value in either the before or the after column. You must state that you are following the after column, if you are doing so. You must also be consistent in which column you choose. I will award the smallest code a week from now (10/27/2014). 3 edited tags | link edited Oct 25 '14 at 9:29 Martin Ender 184k6161 gold badges407407 silver badges890890 bronze badges 2 deleted 15 characters in body edited Oct 25 '14 at 2:08 marinus 30.1k66 gold badges6262 silver badges109109 bronze badges A cyclic tag system is a tiny, Turing-complete computational model consisting of a two-symbol alphabet (I'll use {0,1}), a finite, nonempty cyclic list of production rulesproductions that consist of those two symbols, and an unbounded word which also consists of those two symbols. the first element in the word is removed if it was 0 the current production is skipped if it was 1 the current production is appended to the end of the word. the next production rule becomes active. If this was the last production rule, go back to the first one. A cyclic tag system is a tiny, Turing-complete computational model consisting of a two-symbol alphabet (I'll use {0,1}), a finite, nonempty cyclic list of production rules that consist of those two symbols, and an unbounded word which also consists of those two symbols. the first element in the word is removed if it was 0 the current production is skipped if it was 1 the current production is appended to the end of the word. the next production rule becomes active. If this was the last production rule, go back to the first one. A cyclic tag system is a tiny, Turing-complete computational model consisting of a two-symbol alphabet (I'll use {0,1}), a finite, nonempty cyclic list of productions that consist of those two symbols, and an unbounded word which also consists of those two symbols. the first element in the word is removed if it was 0 the current production is skipped if it was 1 the current production is appended to the end of the word. the next production becomes active. If this was the last production, go back to the first one. 1 asked Oct 25 '14 at 1:53 marinus 30.1k66 gold badges6262 silver badges109109 bronze badges