fnrslvr

18 ms·

31.
by fnrslvr 7y ago
> Before Church, functions weren’t considered mathematical objects that could be passed as arguments to another function, for instance. This strikes me as profoundly ahistorical. Mathematicians have considered function spaces as families
32.
by fnrslvr 7y ago
You're reading a paper that analyzes the capabilities of a particular highly-constrained subclass of Turing machines. Actual research findings aren't necessarily going to be simple just because the model of computation being stu
33.
by fnrslvr 7y ago
> My theory is that snippet and reply may lead to taking quotes out of context and replying with an uncharitable interpretation of the snippet. My theory is that we're all so used to internet debates unfolding in snippet-and-reply-l
34.
by fnrslvr 7y ago
A pedantic note, but what's happened here is that the companies involved have made a commitment to permit you to delete your data from the service. (Which they may or may not properly make good on, I'm not clear on whether they ca
35.
by fnrslvr 7y ago
> You could conceivably "race" searches between P and (not P) and hope that this would save you since now one of the two will return in finite time. Adding to black_knight's point, it's worth noting that even in compl
36.
by fnrslvr 7y ago
> while a classical mathematician will forever be tormented by the existence of theorems they cannot prove in their chosen formalism. As a devotee to the law of excluded middle myself, I don't feel particularly tormented by this. (I
37.
by fnrslvr 7y ago
If the headline question were something more like "can computers prove all theorems reliably?" this response would be more understandable. But a fairer interpretation would be "do automated theorem proving techniques stand
38.
by fnrslvr 7y ago
Whether a neural net could be trained to emulate a compiler seems like the more pertinent question. I've had the displeasure of trying to explain classical learning hardness results to someone who kept repeating back to me "but
39.
by fnrslvr 7y ago
That would be a refutation of the claim that the calculation takes O(n) (or more correctly Omega(n)) time. If the center column turned out to be periodic, then yeah, you're basically on the right track: you would get an algorithm that
40.
by fnrslvr 7y ago
> Doing mathematics doesn't really depend on foundational logic in the same way that, e.g., a web app depends on transistor physics. Web apps don't depend on transistor physics at all, though. An important consequence of Turing
41.
by fnrslvr 7y ago
Okay, but that means that the era of vertical gameplay slices is effectively over, more-or-less exactly as described in the article. It further means that if a lack of gameplay demonstrations at E3 has left you feeling a bit unfulfilled (an
42.
by fnrslvr 7y ago
We might get a case study in this when Cyberpunk 2077 launches (possibly early next year!). CDPR, initially hesitant to reveal to the public the gameplay slice they produced for the media at last year's E3, eventually caved and release
43.
by fnrslvr 7y ago
> As I understood it the large ones like No Man’s Sky or Anthem even doctored gameplay footage during their presentations You're talking about vertical slices created years in advance of any realistic release date, for the sake of d
44.
by fnrslvr 7y ago
Set theory and logic are too interdependent to venture far in one whilst steering clear of the other. For instance, you'll only really skim the surface of model theory without a basic understanding of infinite cardinals.
45.
by fnrslvr 7y ago
Set theory as a toolkit is mostly geared towards questions of consistency/existence, size or "order" of objects, and raw mathematical explanatory power of theories or claims. It traditionally arose to explore ideas of infinit
46.
by fnrslvr 7y ago
Are you familiar with the story? The COO of Riot has been accused of ball-tapping and humping employees. I don't know about you, but if someone "ball-tapped" me in a workplace, I'd be reporting the incident to HR as sexu
47.
by fnrslvr 7y ago
lol, both pivotal sources that I'll swiftly consult when something in my browser goes haywire. Seriously though, when I checked the Mozilla and Firefox twitters (and I don't use twitter, so even going that far was a stretch for me
48.
by fnrslvr 7y ago
Yeah, I guess I could see people coming in with that take. Personally I'll gladly accept a tether to the mothership if they offer the choice. That said, I regularly get thinkpieces from Mozilla about the open internet, privacy, request
49.
by fnrslvr 7y ago
Mozilla doesn't seem to have communicated the issue well. I could imagine a lot of unsavvy users have tried some wild things in an attempt to fix the problem, and maybe made a mess in the process. Doesn't Mozilla have a mechanism
50.
by fnrslvr 7y ago
I'm not sure I see where objects enter into this. I mean, you seem to be asking for something like this, public unit Util { public void foo() { // do things } } which would compile down into a b
51.
by fnrslvr 7y ago
> I think this is a fundamental error since functions and data structures belong in totally different worlds. This is my biggest issue with the article. Blurring the boundary between program and data is one of the core principles at the
52.
by fnrslvr 7y ago
> You could also make a class of global functions and use that I'm not sure I understand your issue with doing this. You need to put your global (i.e. public static) functions in classes not because Java is forcing OO practices into
53.
by fnrslvr 7y ago
> Imperative programming languages (like C and JavaScript) don't generally impose any discipline on the users. I think this view disrespects history a little. C was one of the earliest languages to be conceived upon a foundation of
54.
by fnrslvr 8y ago
I'll add, that I strongly advise against beelining for Gödel's Incompleteness theorems. Learn the formal language aspects, like grammar and parsing and structural induction. Learn semantics. Learn a few deductive calculi (say, nat
55.
by fnrslvr 8y ago
> Mathematical Logic A Mathematical Introduction to Logic, by Herbert Enderton.
56.
by fnrslvr 8y ago
I haven't seen the code, but maybe c&p-ing the C entrant into the C++ box to get performance parity would make the C++ entrant run afoul of typical C++ coding conventions. (You can then have a debate about whether you want to see i
57.
by fnrslvr 8y ago
> Steam is popular and has a loud following because it does not make unethical choices that annoy users. Not true. Valve fought (and lost) a drawn-out legal battle against the Australian Competition and Consumer Commission over the right
58.
by fnrslvr 8y ago
Adding to atq2119's answer, integer programming is merely NP-complete. You really need full Turing computability to get the incompleteness results. The set of provable consequences of Peano arithmetic is RE-complete, and we know that N
59.
by fnrslvr 8y ago
To be fair, recent grads also have an enormous amount of trouble breaking into the industry. The prisoner's dilemma of training up the graduate at a negative return for 2 years before watching them get poached is an issue that's b
60.
by fnrslvr 8y ago
Because I want full encapsulation without giving up by-value semantics. I want my clients to be able to take objects of some opaque record type that I've defined, and put them entirely on the stack, or in some contiguous block of memor

More ›