Footpost

9 ms·

1.
by Footpost 1y ago
Well since Neuromorphic methods can show that 138240 = 0, should it come as as surprise that they enable blockchain on Mars? https://cointelegraph.com/news/neuromorphic-computing-breakt...
2.
by Footpost 1y ago
Neuromorphic computation has been hyped up for ~ 20 year by now. So far it has dramatically underperformed, at least vis-a-vis the hype. The article does not distinguish between training and inference. Google Edge TPUs https://co
3.
by Footpost 1y ago
The reasoning for this choice in the base ISA is discussed in the RISCV ISA manual, Section 2.4 on "Integer Computational Instructions" [1]. Given that RISCV is a modular ISA, it should be possible in principle to have suitab
4.
by Footpost 1y ago
Andy Pitts' writing is extremely clear, whatever he writes about. This clarity is not easy to achieve and shows mastery! The full abstraction for PCF was solved in the mid 1990s by Abramsky/Jagadeesan/Malacaria [1] Hyland&#x2
5.
by Footpost 1y ago
Domain theory has reduced to a trickle, with almost no new results since the late 1990s. Most domain theorist have retired, or moved on to other things. Aside, Andy Pitts has been made a fellow of the Royal Society a few days ago!
6.
by Footpost 7y ago
That's interesting. What would you teach in the language design part of the course? By the time compilers are taught (2nd or 3rd year undergraduate), most students rarely understand advanced language concepts, whether call/cc, GAD
7.
by Footpost 7y ago
The great G.-C. Rota quipped: Probability theory = combinatorics divided by n In this vein let me add: Information theory = log(probability theory)
8.
by Footpost 7y ago
practical DSLs Isn't embedding a "practical DSLs" another toy compiler? Except that with a DSL, you have to worry about gnarly but not-so-interesting problems like what happens to my syntax (given by a CFG) when I ad
9.
by Footpost 7y ago
The main conceptual novelty that modern machine learning brings is the addition of computational complexity in the mix: from information theory's question what is learnable? to what is learnable in poly-time? (or s
10.
by Footpost 7y ago
That's interesting. I certainly did not make the Reddit post. Since there is interest in proto-GANs, here are two more. - J. Schmidhuber, Learning Factorial Codes By Predictability Minimization. (1992) - W. Li, M. Gauci, R. Gross, A
11.
by Footpost 7y ago
Co-evolving parasites This paper strikes me as the earliest manifestation of what would later become GANs (generative adversarial networks). Yes, the mechanism is different (GAs vs NNs), but the spirit (having a competitive mechani
12.
by Footpost 7y ago
They are not mutually exclusive: - Use HoTT or any other type theory as a logic / foundation of math. - Use Hoare logic to reason about programs, using your logic / foundation of math to deal with inferences that are not given by
13.
by Footpost 7y ago
Which of the many possible, highly contentious, and mututally incompatible notions of "social benefit" do you recommend Google adopt, and why?
14.
by Footpost 7y ago
I'm afraid that's not the case. Generics are very easy to implement under the following reasonable conditions: 1. you don't care about performance (you simply 'box' everything), 2. you don't care about executa
15.
by Footpost 7y ago
I'm asking because I'm considering developing an Erlang-like approach to message-passing concurrency for Rust.
16.
by Footpost 7y ago
Would you be able to venture a guess why they are not more popular? I agree that basing Rust's concurrency on an Erlang-like model would not have been a good idea, for reasons mentioned in this thread. Nevertheless the sheer convenienc
17.
by Footpost 7y ago
Is there currently a reasonably mature Erlang-style threading library for Rust? Something that is to Rust what Akka is to Scala?
18.
by Footpost 7y ago
I like the quote "Scala is one of the few programming languages from academia that has had a significant impact on the world as well as on programming languages research" !
19.
by Footpost 7y ago
It has been argued that the raise of the Catholic Church to power had a similar reason: catholic priests don't have offspring (at least in theory) hence priests cannot form dynasties and the advantages (for trust and cooperation) of sh
20.
by Footpost 7y ago
Aha, of course, just like the Berlin Wall was an "Anti-Fascist Protection Barrier"! https://en.wikipedia.org/wiki/Berlin_Wall
21.
by Footpost 7y ago
"Union invaded Poland" in public gets you killed Why? What is taught in schools about this part of Soviet history? Russia isn't even the Soviet Union, and the leader at the time was Georgian.
22.
by Footpost 7y ago
Our algorithm ... Unless I completely misunderstand what you write, the approach you describe is the standard way of setting up SMT-solvers by interaction between a SAT solver with a theory solver. I think it is called lazy SMT