Research: pretty much all commercially driven. What we know is vague and unsatisfying: 'ideal' HRTF varies dramatically between individuals, preference just as much, and people will come to like almost any headphone that's not too extreme.
-
-
Rereading that article, I noticed: "Proving a null hypothesis is akin to proving the halting problem; you can't." No, I can: suppose you had a program that solved the halting problem. Construct a program which calls that program and does the opposite of what it says. Fail!
1 reply 0 retweets 0 likes -
Of course for "Fail!" you may substitute the usual things said at the end of a proof by contradiction. I kind of like "Fail!", though.
1 reply 0 retweets 0 likes -
You can't prove a null hypothesis, but you can keep testing it. Humans function pretty well in a world of halting problems. Most of the time anyway.
1 reply 0 retweets 0 likes -
Oh, agreed about null hypotheses, just saying that the halting problem is the wrong example to use, since the impossibility of solving that actually is rigorously provable, and in fact that's how we know it. A better example might be the Second Law of Thermodynamics.
2 replies 0 retweets 0 likes -
? A halting problem is an example a null hypothesis. "The halting problem" is a meta-analysis of the set of all halting problems that can show them each to be reducible to a null hypothesis. Unless I'm very much mistaken, and I may be.
2 replies 0 retweets 0 likes -
In computer science, "the halting problem" is a very specific problem, and it's been proven that one can't solve it: https://en.wikipedia.org/wiki/Halting_problem … It doesn't have much to do with null hypotheses.
1 reply 0 retweets 0 likes -
Yes, it's a specific problem. And the class of halting problems is a little different than any one specific problem. But I can accept the underpinnings of halting problem analysis and a null hypothesis are logically different.
2 replies 0 retweets 0 likes -
I'm not sure in what discipline there might be "halting problems", plural. If you have a specific program to analyze, you often can tell that it halts; likewise for a specific class of programs; it's only solving the problem in general that is impossible.
1 reply 0 retweets 0 likes -
yes, that's what I'm saying-- 'the halting problem' applies over the class of all problems. No one problem is 'a halting problem'. I got meta, probably to my detriment.
1 reply 0 retweets 0 likes
When I have a halting problem to solve with my car, I press the brake pedal.
-
-
Yes. You can prove 'this will not halt' false by example. Same is true of the null hypothesis.
1 reply 0 retweets 0 likes -
ahem, *a* null hypothesis.
0 replies 0 retweets 0 likes
End of conversation
New conversation -
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.