psygnisfive

18 ms·

1.
by psygnisfive 3y ago
ThePirateBay is not sticking ads in BitTorrented Video shows and movies no matter how little you pay
2.
by psygnisfive 5y ago
Contact the Electronic Frontier Foundation. This is literally what they do. I don't know if they'll take up the case, but talk to them.
3.
by psygnisfive 7y ago
> Security vulnerability finding is almost certainly the wrong target for Semmle CVE-2019-5876 CVE-2019-16230 CVE-2019-16231 CVE-2019-16232 CVE-2019-16233 CVE-2019-16234 CVE-2019-15026 CVE-2019-14192 CVE-2019-14193 CVE-2019-14194 CVE-201
4.
by psygnisfive 9y ago
mm.. perhaps I'm just not familiar enough with prolog, but I don't think it's possible to extract out a set of Prolog-level metavariables and compute over them? This is what's necesary to turn something like `_G947 ->
5.
by psygnisfive 9y ago
I'd also recommend Practical Foundations for Programming Languages (PFPL). And a bunch of other things, which I outlined here: So You Want To Learn Type Theory ( http://purelytheoretical.com/sywtltt.html )
6.
by psygnisfive 9y ago
Indeed! Tho this is only half the problem, because `T` there includes metavariables, so it's not a type but rather a schema at the meta-level for types. What we'd like is something like `forall a b c. (b -> c) -> (a -> b)
7.
by psygnisfive 9y ago
Ahh, well! That's a trickier problem! You need a bidirectional system that has unification for metavariables, and then some system for handling unsolved metavars. But to do that requires a more complicated set up. The goal of the post
8.
by psygnisfive 9y ago
It was also front page on HN at the beginning of 2015 ;)
9.
by psygnisfive 10y ago
Yeah, we're cross posting from my blog to the official IOHK blog, too. The first post only just got up on IOHK :p
10.
by psygnisfive 10y ago
Oh! Was Murray Shanahan's lab involved with this? Cool. I've chatted with Murray a very tiny bit on twitter about this all. That paper is part of what inspired me to write this blog post, because I was dissatisfied with the approa
11.
by psygnisfive 10y ago
That's correct, yes. Cycles don't affect subgraph counts. There's still only finitely many.
12.
by psygnisfive 10y ago
Reading a graph back can't be done with any certainty, nor is it intended to be done. It's a representation that's intended to be used to build inputs to ML systems, not outputs. Building symbolic outputs should be done via t
13.
by psygnisfive 10y ago
Oh! Thanks for pointing this out. The whole site is hand maintained, and I routinely forget to put stuff up there. :)
14.
by psygnisfive 10y ago
I think to some extent it disappeared, to some extent it rebranded. But mostly it disappeared, because commercial motivations pushed a lot of money towards machine learning research. But that's just a hunch.
15.
by psygnisfive 10y ago
Grammar inference is a very interesting (tho quite different) topic. We have absolutely no idea how humans do it, and we know that its really really hard (nearly impossible!) to do given just raw text. Super interesting topic!
16.
by psygnisfive 10y ago
It's a very small unification, and a big, eye-catching claim. Besides, I said "aims", not "succeeds"! :) I certainly don't think this is The Big Solution, tho. It's far more mundane. Unifying the technique
17.
by psygnisfive 10y ago
I know of no other work like this, unfortunately. But I would caution against saying this is a Vector Symbolic Architecture; the representations are, as far as I know, quite distinct.
18.
by psygnisfive 10y ago
Heyo. Author here. It depends on what you mean by that. It assumes a fixed set of node labels , but not node identities, since we're counting subgraphs. So for instance, multiple distinct nodes labeled `X` or edges labeled `Y` will co
19.
by psygnisfive 10y ago
The general idea here is that you can calculate not only whether or not a string matches a regex, but if it doesn't match, precisely by how much (in the minimal case).
20.
Regex Edit Distance(languagengine.co)
2 points by psygnisfive 10y ago|1 comments
21.
by psygnisfive 10y ago
Buy instant(ish) noodles from an asian grocery. They often have lots of great variety and are cheap and healthier than the ramen you'll usually get in big chain groceries. In fact, but as much as you can from asian groceries, they tend
22.
by psygnisfive 11y ago
Gosh, people are really interested in this suddenly, huh? Well, I can answer any questions people may have! :)
23.
by psygnisfive 11y ago
I'd caution the reader that this post is about purely functional, type theoretically defined languages. I haven't yet generalized to languages with implicit effects (tho I suspect it's possible). Explicit, type-defined effect
24.
Generic Evaluators – defining language-generic evaluators (lazy/eager/stack &c)(languagengine.co)
1 points by psygnisfive 11y ago|1 comments
25.
by psygnisfive 11y ago
As CHC says below, "dynamic" typing is no different. It's just a deferment of wrongth, not a lack of it. But if I were to take a staunch SPJian-McBridian position, I would say this attitude arises from really useless type sys
26.
by psygnisfive 11y ago
I wonder if this is a reanalysis of initial clipping. English lets you do some pretty aggressive deletion of initial segments of an utterance, and in many many cases that ends up being just a pronoun.. hmm
27.
by psygnisfive 11y ago
When Bob says that it's restrictive, what he means is simply that you cannot say more. Which is true -- you can't express things when your only type is "something". You're allowed to saying nothing, and that's
28.
by psygnisfive 11y ago
I put together this little blog post showing how bitwise logic operators secretly have Sierpinski Triangles lurking in them. They also have other interesting patterns too, if you use different operators.
29.
Sierpinski Triangles in Bitwise Logic(languagengine.co)
6 points by psygnisfive 11y ago|1 comments
30.
Making Sense of Subtypes (a tutorial on how not to mess them up)(languagengine.co)
2 points by psygnisfive 11y ago|0 comments

More ›