I'm not sure, but I suspect Markov chains can simulate any computable process. So Markov chain speech generators are just primitive GAIs.
@FrameOfStack I'm not sure that is correct. You mean to say that a Turing machine simulates a MC-program and does the opposite?
-
-
@MakerOfDecision I mean negate a markov chain LEARNER, for instance PPM. Result diagonalizes markov. -
@FrameOfStack Thanks! A Diagonalization proof seems sufficient to change my mind ;) I'd like to see it - link? - 2 more replies
New conversation -
-
-
@FrameOfStack Because I think we can just add a node replacing/after the final output of the initial MC-machine; "do the opposite".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.