Timeline for Function that produces \$a^nb^nc^n\$

13 events

when toggle format	what		by	license	comment
Dec 14, 2015 at 22:03	comment	added	Carl		Only in the sense of sharing partial future results with the current value. That's not so hard to implement, but it's usually not a win. You end up trading fast in-cache loops for slow pointer chasing.
Dec 14, 2015 at 17:33	vote	accept	Michael Chav
Dec 14, 2015 at 17:30	comment	added	Michael Chav		Rebuilding the string from scratch every time. Isn't there a way to do it cumulatively?
Dec 13, 2015 at 17:08	answer	added	Carl		timeline score: 2
Dec 13, 2015 at 7:22	comment	added	Carl		Out of curiosity, what duplicate work do you think you're doing? I'm willing to bet your first version is as efficient as possible on `String`, assuming the `replicate`s fuse with the `(++)`s properly.
Dec 11, 2015 at 1:39	answer	added	200_success		timeline score: 7
Dec 11, 2015 at 1:18	history	edited	200_success		edited tags
Dec 11, 2015 at 0:27	review	Close votes
Dec 11, 2015 at 6:19
Dec 11, 2015 at 0:00	history	edited	holroy	CC BY-SA 3.0	edited title
Dec 10, 2015 at 23:45	history	edited	Vogel612	CC BY-SA 3.0	math-jaxed string form
Dec 10, 2015 at 23:43	comment	added	Michael Chav		a^nb^nc^n is Turing Computable but not context free.
Dec 10, 2015 at 23:39	comment	added	Vogel612		This sounds like you're trying to create the Language of a context-free grammar, is that correct?
Dec 10, 2015 at 23:16	history	asked	Michael Chav	CC BY-SA 3.0