Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
l33t2328
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
16 ms
·
151.
▲
by
l33t2328
4y ago
For the intended audience of a paper, many things are considered trivial or easy. The attitude may be harmful when teaching(if you’re unaware of what the students find trivial), but in professional communication it is a signal to the reader
152.
▲
by
l33t2328
4y ago
Just don’t include formulas you can’t motivate simply. Will it result in students not knowing as many formulas? Of course, but who cares?
153.
▲
by
l33t2328
4y ago
This seems to be a convoluted way of saying “hope for the best plan for the worst.”
154.
▲
by
l33t2328
4y ago
You can develop an intuition divorced from meaningless formulas. It goes without saying this proposed class wouldn’t be based around memorizing unmotivated formulas.
155.
▲
by
l33t2328
4y ago
But statistical literacy doesn’t. Sure, they may not be able to tell you what is a measurable function, but they can explain the way you should feel about a p-value.
156.
▲
by
l33t2328
4y ago
Uhh...this seems like legitimate schizoposting. I hope all involved seek and receive help.
157.
▲
by
l33t2328
4y ago
This is relevant: http://shattered.io/
158.
▲
by
l33t2328
4y ago
It is always possible to generate a collision for any hash function since they are not injective by definition.
159.
▲
by
l33t2328
5y ago
> even Hash-functions should be largely built out of invertible operations Why is that? I don’t understand why you should minimize the loss of entropy at any particular step. Is it to help resist collisions? > I could explain why but
160.
▲
by
l33t2328
5y ago
Yes! We’d like our cryptographic hash functions to be collision resistant and preimage resistant. That is, we’d like it to be hard to generate 2 different messages m1 and m2 where the hash of m1 is equal to the hash of m2, and we’d also li
161.
▲
by
l33t2328
5y ago
Right but explaining why the reals are different is the tricky part
162.
▲
by
l33t2328
5y ago
You’re certainly aware of this, but for those that aren’t: asking that the “probability” in the space to be well defined you are essentially invoking the idea that the function is _measurable_. Measure is a way to generalize things like len
163.
▲
by
l33t2328
5y ago
I’m arguing that logic is a subfield of CS, so “constructing” CS “from” logic isn’t a contradiction.
164.
▲
by
l33t2328
5y ago
> Even a real interval of a finite length cannot be covered by any set of intervals of a smaller total length. You’ve only restated the problem without saying _why_ covering the reals is different.
165.
▲
by
l33t2328
5y ago
Each real number can be represented as a subset of the natural numbers. CS surely studies these.
166.
▲
by
l33t2328
5y ago
Sure. Explaining what’s different about the reals is the hard part
167.
▲
by
l33t2328
5y ago
What is a “hostile fork?”
168.
▲
by
l33t2328
5y ago
I mean that for any epsilon > 0, you can have a set of intervals of the form (a_i, b_i) where every rational number is in some interval and the sum over all i of b_i - a_i < epsilon. That is, you can cover the rationals with intervals
169.
▲
by
l33t2328
5y ago
Yes, of course. Because definable (really, computable) numbers don’t really “exist” either.
170.
▲
by
l33t2328
5y ago
I’d argue that logic is a subfield of computability theory, and so by extension we (in CS) absorb math.
171.
▲
by
l33t2328
5y ago
So? Neither can the list of possible computer programs, yet CS studies them
172.
▲
by
l33t2328
5y ago
Cardinality hasn’t much to do with it since there are uncountable sets which you may cover like that.
173.
▲
by
l33t2328
5y ago
The results aren’t often nearly as useful as the techniques used to find them. For example, a completely opaque proof resolving P vs NP is completely useless to theoretical CS.
174.
▲
by
l33t2328
5y ago
I’d argue math is actually (a proper subset of) CS.
175.
▲
by
l33t2328
5y ago
I contend no one understands real numbers if they can’t explain (without resorting to essentially purely symbolic rigor) why you can cover the rationals with intervals of arbitrarily small total length, but you can’t do the same with R.
176.
▲
by
l33t2328
5y ago
Mmm, seems troublesome to detect sarcasm, context, etc. When the setting is legal, these such errors are unacceptable.
177.
▲
by
l33t2328
5y ago
They’re just given the same script by corporate.
178.
▲
by
l33t2328
5y ago
That seems really hard. How would you identify a joke/insult vs a neutral post vs praise?
179.
▲
by
l33t2328
5y ago
Using proxies to hide your identity to get around a denial of access seems to get awfully close to violating the Computer Fraud and Abuse Act(in USA, at least). I’m surprised your school was okay with it.
180.
▲
by
l33t2328
5y ago
> they literally shot JFK, the elected president, almost 60 years ago Are “they” in the room with you right now?
More ›