mdxn

7 ms·

1.
by mdxn 5y ago
The author grew up in Michigan (although somewhat closer to southeast MI).
2.
by mdxn 5y ago
> "unaware that in nearby Ohio," Clearly this was written by a coastal or someone who needs a lesson in geography. Vulcan, Michigan, and for that matter most of the Upper Peninsula is closer to 3 other states including Iowa tha
3.
by mdxn 6y ago
Lattice based cryptography can actually be made pretty accessible and can be taught to highschoolers and fresh undergraduates (I have done this with students at my job) as long as you give them a couple of math tools they may not have: matr
4.
by mdxn 6y ago
Encryption keys do not have to give "all or nothing" access to encrypted material. With homomorphic encryption and related primitives, you can shape things in a much more finer grained manner and only expose carefully crafted part
5.
by mdxn 6y ago
This is a misapplication of that principle and runs the risk of turning into the toxic gatekeeping that I know first hand has kept many talented people out of the academic cryptography community. The authors of this work implement their sys
6.
by mdxn 6y ago
> This is not a peer-reviewed research paper. It seems to be a project report likely done by undergraduates. The paper is full of typos and it is not clear what the specific novelty of the proposal is (if there is any). This is not a con
7.
by mdxn 7y ago
There is definitely a difference. The problem with the vast majority of "Turing-completeness in X" claims on HN is that they are just logically complete Boolean circuits that are overgeneralized (infinitely tessellated or scaled)
8.
by mdxn 9y ago
The average GPA of millionaires alone is obviously not enough information to make the conclusions that this video is making. An average GPA of 2.9 is not far off from the average college GPA of regular students, anyways (for, let's say
9.
by mdxn 9y ago
I think what you are claiming here is misleading. Some pre-processing SNARK constructions (particularly ones used by some ZCash scientists) are based on multi-round interactive proof systems which reduce to one round (depending on how you c
10.
by mdxn 10y ago
Withdrawn already "The paper has been withdrawn due to a mistake in the last line of the proof--it does not hold for n=0. Thanks to Terry Tao for pointing out this crucial gap"
11.
by mdxn 11y ago
The hackathon that they mention in the post (Mhacks) put up an application process and enforced a 50/50 gender ratio. In the weeks leading up to the event, I overheard many defeated conversations from fellow CS students over anxiety of
12.
by mdxn 11y ago
Here's a link to Zcash's first blog post on their official site: https://z.cash/blog/helloworld.html
13.
Zcash, an Untraceable Bitcoin Alternative, Launches in Alpha(wired.com)
19 points by mdxn 11y ago|1 comments
14.
by mdxn 11y ago
People reading this write-up should keep in mind that the author uses the term "complexity class" incorrectly. When the author says this, they actually mean "worst case runtime". It never dives into space complexity, whi
15.
by mdxn 11y ago
For those who are interested, Berkeley has publicly available lecture notes for their Randomness & Computation course. They go over some randomized algorithms as well as the mathematical tools necessary to analyze them. Just a heads up,
16.
by mdxn 11y ago
The actual decision problem statement for TSP is "Does there exist a tour of less than length L". It is easy to prove if such a tour exists: simply give me tour. I can sum up the lengths and check that the sum < L. Finding such
17.
by mdxn 11y ago
I heavily suspect this claim is wrong due to some amateurish mistakes. In particular, I believe the author is confusing the concepts of "checking" a solution and "searching" for one. At some points in the paper, their us
18.
by mdxn 12y ago
I get the gist of what you are saying and agree with some of it. I still think the article isn't sufficient, at all, for even an elementary introduction to anything. It's incredibly incomplete. An introductory cs course is going t
19.
by mdxn 12y ago
I'll ignore discussion as to what counts as a step, what "n" is, or how it doesn't necessarily reflect on the real world. I still feel like this article focuses on the wrong thing. It's equivocating Landau notation
20.
by mdxn 12y ago
I can see how it can be read that way, though you should also to look at this from his perspective (or at least my guess as to a possible perspective). The internet (and the field) is flooded with nonsense papers that don't respect the
21.
by mdxn 12y ago
I think you would have to be assuming that the far-advanced civilization's simulator has the same complexity as the models of computation we can construct. I think that's a huge leap to make. We might not be able to model somethin
22.
by mdxn 12y ago
This is overly general. And we need to make a distinction between actual physics (laws of Nature) and our theoretical models of such. Yes. Our theoretical models of the laws of physics are usually formal and axiomatic systems of logic (basi
23.
by mdxn 12y ago
HN is not your personal editorial or blog. (Note: at the time of writing, his comment was the only one present). Also, I'm going to ignore how cliche the 'Americans are sheep and should wake up' attitude is. That said, I don&
24.
by mdxn 13y ago
Back in highschool, I wrote an Uno clone for a final project in Java. I ended up encountering a similar issue for when I was defining constructors for Card objects. At some point, I had to cast null as an Object to rid of some ambiguity. St
25.
by mdxn 13y ago
There are a lot of things here that I take issue with. Some things I find relatively insulting. I wrote up a list, but I'd rather you spend your time answering the following challenge: Describe to me any particular infinite process whi
26.
by mdxn 13y ago
This database includes emails that were simply listed in these data breaches. Newer Adobe account emails were put in as entries in the database, but their associated password/hint data was not. There were quite a large number of these
27.
by mdxn 13y ago
What you are talking about is actually the difference between two different notions of infinity: actual and potential. I think you identify these, but do not quite separate them as much as I believe you should. Potential infinity aligns wit
28.
by mdxn 13y ago
Can you be more specific about the nature of the logic you are using when concluding that a "completed infinity" is a self-contradiction? Are you sure that you aren't naively equivocating abstract notions of infinity with car
29.
by mdxn 13y ago
In your set of positive even numbers example, you are only showing that a specific enumeration scheme does not generate the set of even numbers. A diagonalization argument requires that you show that no such enumeration scheme can exist (no
30.
by mdxn 13y ago
The answer is no. My standard mainly focuses on preventing the player from making choices after the "machine" executes. Choices here include instructions for the player from the spec about how to handle certain situations. As the

More ›