I'm not sure, but I suspect Markov chains can simulate any computable process. So Markov chain speech generators are just primitive GAIs.
@FrameOfStack Thanks! A Diagonalization proof seems sufficient to change my mind ;) I'd like to see it - link?
-
-
@MakerOfDecision Real answer is automata theory; markov chains lack a stack (can't simulate context-free) or tape (can't be arbitrary TM). -
@FrameOfStack Lesson learned: I only took 1 class in finite automata, state machines and complexity. I should take more.
End of conversation
New conversation -
-
-
@MakerOfDecision um well this is related http://www.vetta.org/documents/IDSIA-12-06-1.pdf …Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.