Cool work. I wonder if contemporary proof assistants have enough primitives to implement this.
> pure math (topology and countability) and computer science have almost no overlap in the short term. This is an unexpected opinion. What do you mean by this? I would argue the opposite. Look at Formal Verification[0].…
I wonder(worry) that this dump is actually a key honeypot. May have people thinking: "I already have a <STREAM-SERVICE> account, but with this I could at least get 4k." They put their legitimate key in, and maybe it…
Cool work. I wonder if contemporary proof assistants have enough primitives to implement this.
> pure math (topology and countability) and computer science have almost no overlap in the short term. This is an unexpected opinion. What do you mean by this? I would argue the opposite. Look at Formal Verification[0].…
I wonder(worry) that this dump is actually a key honeypot. May have people thinking: "I already have a <STREAM-SERVICE> account, but with this I could at least get 4k." They put their legitimate key in, and maybe it…