Welcome to 15 years ago?
436 karma · joined September 1, 2007
Welcome to 15 years ago?
Furthermore, why should we worry about changing JSON? It's not amazingly difficult to construct a parser for some custom document format like this, after all. I use a subset of Ruby as a data interchange format because of the ability to use arbitrary values as hash keys, and the ability to have symbols that are distinct from strings. The parser for it is maybe 80 lines at most, and doesn't rely on Ruby internals to handle it. Because Ruby also doesn't have a Date/Time literal notation, I have a way of denoting that (datetime(...)) which the parser also handles.
There's no reason people should be talking about this, it's a non-issue. It's never too late to change JSON, or to even do something completely different that better suits your needs. Just write the parser for it!
And if the issue is "OMG interoperability! :(", it's not terribly diffuclt to provide your developers with the JavaScript lib to handle the parsing.
Easter Island isn't some big mystery, unless you don't read history books.
</pedantry>
Psycholinguistics research has repeatedly shown that the amount of influence is minimal, amounting to, in general, forcing you to pay attention to certain aspects of the world more so when you're describing using language than when you're thinking about things in other ways. E.g., you notice color differences more quickly or more accurately when you have to choose between two words that your language could have, than if you were picking a tee-shirt. Or you're more attentive to left and right orientation if your language has words for left and right when you're talking about something positioned relative to your body, but if you're just trying to navigate somewhere or looking for something, your language doesn't affect your thinking.
This effect is precisely what you'd expect, ofcourse, because you get it for absolutely everything else. If your culinary habits involve avoiding high fructose corn syrup, when you're looking for food you're going to be quicker to notice the presence of HFCS than if you're just talking to someone and they mention the corn industry's current HFCS production rates or whatever.
The generalization: when some cognitive task requires that you pay special attention to something, you will. Language is not special in this regard.
And that is how language influences the way we think.
The experiment was done to see if the effects of psychedelics were merely "right-brained" and creativity enhancing, or if they could improve harder more technical cognition as well. It turns out they do improve technical cognition quite drastically.
This effect is precisely what you'd expect, ofcourse, because you get it for absolutely everything else. If your culinary habits involve avoiding high fructose corn syrup, when you're looking for food you're going to be quicker to notice the presence of HFCS than if you're just talking to someone and they mention the corn industry's current HFCS production rates or whatever.
The generalization: when some cognitive task requires that you pay special attention to something, you will. Language is not special in this regard.
And that is how language influences the way we think.
def inc_all(i, xs)
xs.map { |x| x + i }
endComputability and completeness are also definitely related, but, not quite so tightly as you implied. Computability is a property of algorithms, while completeness is a property of axiomatic systems. Algorithms operate on axiomatic systems, but are not the systems they implement, and there's no inherent connection between being able to prove statements about a system, and the algorithms used to compute proofs for that system. As I said, SOL can prove FOL to be complete and consistent, and you can do this on a universal turing machine, but FOL cannot prove itself to be complete and consistent even doing this on a universal turing machine.
Of course, if your computer _is_ an axiomatic system (and all are), then the incompleteness theorem(s) do say things about what that computer can do, and we know that all turing complete computers have precisely the same sorts of constraints in that regard.
The real thing that was irksome, tho, was the assertion that there are some things that are obvious to humans but which are uncomputable. This is just unfounded. Unless you're supposing human brains are somehow not computing things (collections of neurons are computers, after all, just not von Neumann architecture), there is no way for this statement to be true.
Firstly, the incompleteness theorem (there's only one) is not about computation but about proofs; specifically that there are some things within an axiomatic system which are true which cannot be proven such within the system itself.
Secondly, this does not mean that these things are unprovable, period. For instance, Gödel showed that you can prove these things perfectly fine, you just have to use different system. But this system will have its own unprovable statements.
Thirdly, computability was Turing's domain, not Gödels, and has to do with the kinds of algorithms you can use to perform proofs, not the system the proof is for. For example: second-order logic (SOL) can prove things about first-order logic (FOL) that FOL cannot prove about itself, but both systems can by utilized by a universal turing machine.
Fourthly, there is no known thing that cannot be proven, period, which is obvious for us humans.
http://en.wikipedia.org/wiki/Television
I'll be brutally honest: Not cool. It's old and boring and not in the least difficult. The software is what would've taken a while to make, and even that would theoretically consist of little more that two for loops to scan through each frame of video and output it to the audio jack.