... Technically speaking, I'm not sure this is correct. What can we say about the difficulty of *the* process of generating strings (not just any "random"...
Michael notes that the complexity of a random string is higher than that of a poem of similar length, but asserts that it is harder to learn to generate poetry...
... I think we mostly agree... The term model implies the existence of a shorter descriptions in some fixed universal description language. Therefore...
... I'd like to, but I have to clean the bathroom. For now I'll just note that babies are born babbling (well, maybe not literally, but they do a lot of...
... Try a thought experiment. Imagine a process that generates a bit stream by flipping a "fair coin". It emits a '0' for heads, '1' for tails. Also suppose...
... Probably yes. ... Probably yes. LOL. True, as the baby learns more, its outputs become more organized and less random. The baby's neural systems start out...
... Yes. Baby babbling is usually quite repetitive. ... No, is what I want to say. But, I'm not sure this is such an easy question to answer. There is...
... <somewhat snide remarks> Actually, on thinking more about it, I'm not sure whether I'm right or wrong about this, or whether there is a "right" answer. ...
... Yes. A good example of this was Claude Shannon's "penny matching" machine, which usually beat a person by about 5%. Knowing the algorithm it used,...
This really rocks... http://video.stumbleupon.com/#p=0oydjilqgz I've seen his work before but never in such detail. I find the binary computer he built very...
... Let me put it another way: There are those who want to fiddle around with the shapes of wings. There are those who want to build a science of aerodynamics....
... If you know the model, fair coin generates stream of bits, then you know that past bits tell you nothing at all about future bits. But isn't that cheating?...
Bayesian: Socrates is probably a man. Most men are mortal. Socrates will likely die. Citizen: It's true! I had a dog named Socrates, and he died! Cartoonist: ...
... The fact that we are talking about natural language makes such statements very hard to grapple with. Natural languages change over time, have an almost...
... ;-) http://www.princeton.edu/~wbialek/learning_links.html "We have reached an understanding of the connections between learning and complexity as unified...
... ... How does predictive power equate with knowledge and how is this related to sematic vs. episodic knowledge? Also each learning system must have a limit....
... I find this quote relevant to your comments: http://www.princeton.edu/~wbialek/our_papers/bnt_01a.pdf quote: Put bluntly, nonpredictive information is...
... I think this tells us something about the fundamental limit of the meaning of Kolmogorov complexity. What if the sentence or poem is generated quantum...
... <snip> ... How are you defining "quantum complexity"??? Consider the following quote: http://tinyurl.com/6lcrw5 quote Formal Systems It can readily be...
... I thought I should be less cryptic... so here I go: As far as I can tell, it is your use of this term "quantum complexity" that is within "the realm of...
John, Indeterminacy in quantum systems requires three degrees of freedom, or 3 qubits, just as we need three independent variables to generate chaos in...
... As long as one of those three degrees is labeled "undecidable" I'm good with it. It's only when someone wishes to apply the tag "both" in any serious...
... Agreed, we only see discrete outcomes. If decidable, we get a deterministic outcome, otherwise we get a random outcome. However, if we ask what outcomes...
... Shaka, when the walls fell... ... Temba, his arms wide ... Zinda, his face black, his eyes red!!! ... Sokath, his eyes uncovered! Picard and Dathon at...
John, Your cathartic culmination of our meta allegorical communications is tempered only by my consternation over the unchallenged statement of "irreducible...
... If the "statement" is an assertion then it was rightly unchallenged on my part. If the statement is not an assertion then "irreducible randomness" remains...