@davidmanheim looks like a Markov chain text generator for International Relations and Political Science
-
-
Replying to @ervant
Markov Chain models are Turing complete. So in a way, any time anyone tweets anything, it's a Markov chain generator.
@ervant@davidmanheim4 replies 0 retweets 1 like -
Replying to @PacketOfData
Allele Of Gene Retweeted
Allele Of Gene added,
This Tweet is unavailable.1 reply 0 retweets 0 likes -
Replying to @AlleleOfGene
@PacketOfData@ervant@davidmanheim@jckuri Finite state automata aren't Turing complete, since no halting prob.; same goes for Markov.1 reply 0 retweets 0 likes -
Replying to @AlleleOfGene
@AlleleOfGene@ervant@davidmanheim@jckuri Halting problem isn't applicable to instantiable Turing machines either; tape is finite.3 replies 0 retweets 0 likes -
Replying to @PacketOfData
@PacketOfData@AlleleOfGene@ervant@davidmanheim@jckuri Paper says bounded-machine halting problem can be solved by unbounded machine.1 reply 0 retweets 1 like -
Replying to @ProofOfLogic
@PacketOfData@AlleleOfGene@ervant@davidmanheim@jckuri Seems there's still a halting problem for bounded machines if we restrict to them1 reply 0 retweets 1 like -
Replying to @ProofOfLogic
@ProofOfLogic@PacketOfData@ervant@davidmanheim@jckuri Hmm that's surprising. I'll have to read it later.1 reply 0 retweets 0 likes -
Replying to @AlleleOfGene
@AlleleOfGene@PacketOfData@ervant@davidmanheim@jckuri I skimmed, could be mistaken. But why surprising?1 reply 0 retweets 0 likes
@AlleleOfGene @PacketOfData @ervant @davidmanheim @jckuri How could 1 bounded machine handle *any* bounded machine?
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.