g___

8 ms·

1.
by g___ 2y ago
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 this machine will halt given its own source code as input. I
2.
by g___ 2y ago
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. Here's a 5h video with the history. Bismuth says the his
3.
by g___ 3y ago
The videos are old, but the blog series is new, Dec 2023.
4.
by g___ 3y ago
This was fixed.
5.
by g___ 3y ago
"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 Microsoft, Google, Mozilla and Citrix symbol server
6.
by g___ 4y ago
Probably because million is unambiguous. Billion sometimes refers to 10^12 rather than 10^9.
7.
by g___ 8y ago
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...
8.
by g___ 8y ago
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.
9.
by g___ 8y ago
Hammock driven development https://www.youtube.com/watch?v=f84n5oFoZBc
10.
by g___ 8y ago
David Beazley: Python concurrency from the ground up https://www.youtube.com/watch?v=MCs5OvhV9S4
11.
by g___ 8y ago
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 run slowly (e.g. O(N^2) or exponential).
12.
by g___ 8y ago
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 vs
13.
by g___ 8y ago
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 | Node2 (Tree2 [a]) flatten2 :: Tree2 -> [a] Tree1 can vary
14.
by g___ 9y ago
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-noise)
15.
by g___ 15y ago
Related post: Mathematical Embarassments http://rjlipton.wordpress.com/2009/12/26/mathematical-embarr...