Viewing profile — g___
g___
HN member- Joined
- Mon, Oct 17, 2011, 3:13 PM UTC
- HN karma
- 59
- Public activity
- 18 items
- HN profile
- View on Hacker News ↗
About g___
No profile information was provided.
Recent public activity
-
comment
Comment #40138604
Suppose O is the oracle for the halting problem. We create a machine: given a program P, ask O whether P halts given input P and negate the answer. λP. ~O (P P) Now we ask whether …
-
comment
Comment #40027990
For over a decade, the author of this video has been leading an effort to complete Super Mario 64 with the smallest amount of A presses, often using extremely complex strategies. H…
-
comment
Comment #38690383
The videos are old, but the blog series is new, Dec 2023.
-
comment
Comment #38612951
This was fixed.
-
comment
Comment #37433683
"In addition to targeting researchers with 0-day exploits, the threat actors also developed a standalone Windows tool that has the stated goal of 'download debugging symbols from M…
-
comment
Comment #34903959
Probably because million is unambiguous. Billion sometimes refers to 10^12 rather than 10^9.
-
comment
Comment #19306426
At least FreshDesk has an "occasional agents" option (users who are paid per every day they logged in). https://support.freshdesk.com/support/solutions/articles/227...
-
comment
Comment #19019584
This is the only one I remember that matches your description. I also liked "Simple made easy" by the same presenter but it's a completely different topic.
-
comment
Comment #19012603
Hammock driven development https://www.youtube.com/watch?v=f84n5oFoZBc
-
comment
Comment #18218100
David Beazley: Python concurrency from the ground up https://www.youtube.com/watch?v=MCs5OvhV9S4
-
comment
Comment #17441918
You need more than termination to protect against a denial of service; you need to know that a function terminates promptly. Most denial-of-service attacks are about functions that…
-
comment
Comment #17089597
Another interesting paper is "Build Systems à la Carte" https://www.microsoft.com/en-us/research/uploads/prod/2018/0... which explains characteristics of some build systems "static…
-
comment
Comment #16951843
Right, you can have rose trees without polymorphic recursion: data Tree1 a = Leaf1 a | Node1 [Tree1 a] flatten :: Tree1 -> [a] But this type needs it: data Tree2 a = Leaf2 a | Node…
-
comment
Comment #15429050
I've read it and highly recommend it. Does anyone know books that are similar in style? (conceptual, showcasing different solutions to problems and their tradeoffs, high signal-to-…
-
comment
Comment #3283166
In fact, first three lines could be written in one, although a longer one logProb = 0 for featureValue in featureVector: logProb += math.log(self.featureCounts[(label, self.feature…
- comment
-
comment
Comment #3120800
Related post: Mathematical Embarassments http://rjlipton.wordpress.com/2009/12/26/mathematical-embarr...
- comment