bmc7505

18 ms·

151.
by bmc7505 4y ago
> I still don't follow... The premise was "toolability" in language design, which is one of Kotlin's main design principles. To do type-safe completion, navigation or refactoring, you need soundness, and to do
152.
by bmc7505 4y ago
That's certainly a design choice they're free to make. Undecidability itself is less of a deal-breaker, although I would argue that a statically-typed language which is unsound defeats the purpose of having static types in the fir
153.
by bmc7505 4y ago
> Do you mean JVM language? TypeScript, C#, and F# at least come to mind. As I mentioned in another comment [1] on this thread, soundness and decidability are non-negotiable for me. Types in C#, F# and TS are all Turing Complete
154.
by bmc7505 4y ago
Types in TS are Turing Complete [1], so any static analysis you build ontop of that language is bound to be unsound or undecidable. You could argue this rarely occurs in practice, but I would prefer a type system that is incomplete but soun
155.
by bmc7505 4y ago
Having used Kotlin on and off for the better part of a decade, the one thing I can say is that their editor support is unrivaled by any other language today. While Kotlin's build tools leave much to be desired (looking at you, Gradle),
156.
Bent Function(en.wikipedia.org)
1 points by bmc7505 4y ago|0 comments
157.
by bmc7505 4y ago
Interesting. Not disagreeing with you, but just out of curiosity, are there any other reasons why you believe research quality has declined at Mila specifically, outside the broader trend that progress in deep learning is starting to slow,
158.
by bmc7505 4y ago
Locomotion? Nervous systems? Skeletons? All this trial and error will never amount to anything. The jury is still out. Bacteria and plants may outlive us yet…
159.
by bmc7505 4y ago
Your flowchart neglects to mention the potential upside: Do you want to experience the results of runaway nuclear chain reaction firsthand? Become a Wikipedia entry? Impress the labmates with your prowess at tickling the dragon's tail?
160.
by bmc7505 4y ago
Montreal still is a AI powerhouse. Most of the same people who were here ten years ago still are, and still working on the same research topics, just with less flashy PR. https://youtube.com/watch?v=LVXkISpbq2k
161.
SAT-Solver and Optimization-Based Preimage Attacks on SHA-256(trevphil.com)
5 points by bmc7505 4y ago|0 comments
162.
Tarski's high school algebra problem(en.wikipedia.org)
2 points by bmc7505 4y ago|0 comments
163.
by bmc7505 4y ago
There is a GitHub repository: https://github.com/OriRoth/python-typing-machines
164.
by bmc7505 4y ago
Does anyone know if the Java hyperbolic tree visualization they were showing (or a similar implementation for the JVM) is still available, either open source or as a library on Maven Central?
165.
by bmc7505 4y ago
Compared with MSR or Brain which have over 100x their headcount, JBR punches well above their weight in CORE CS conference and journal publications.
166.
by bmc7505 4y ago
JBR is one of the very few industry labs that conducts pure research in CS and programming language theory. For a relatively small company, their publication record is exemplary. https://scholar.google.com/scholar?hl=en&
167.
by bmc7505 4y ago
https://arend-lang.github.io
168.
by bmc7505 4y ago
Previous thread (from 2008!): https://news.ycombinator.com/item?id=317213
169.
Equilibrium in the Jungle (2007) [pdf](arielrubinstein.tau.ac.il)
1 points by bmc7505 4y ago|0 comments
170.
by bmc7505 4y ago
Computing the matrix exponential is equivalent to finding the eigenvalues of a companion matrix, which in turn is equivalent to finding the roots of its characteristic polynomial. If you have nineteen ways of computing a matrix exponential,
171.
by bmc7505 4y ago
https://www.math.purdue.edu/~yipn/543/matrixExp19-I.pdf
172.
by bmc7505 4y ago
Makes you wonder if we would encounter any familiar-looking life forms on other Goldilocks zone planets…
173.
by bmc7505 4y ago
"And when your surpassing creations find the answers you asked for, you can’t understand their analysis and you can’t verify their answers. You have to take their word on faith—Or you use information theory to flatten it for you,
174.
by bmc7505 4y ago
> I think that’s moving the goalposts. It depends on your cost model. If your cost model is with respect to n, this requirement does not move the goalposts because the solution in the article does not depend on n and k is fixed. Computin
175.
by bmc7505 4y ago
How do you map a Natural to the corresponding subset in O(1), while still preserving the compactness of the fixed-size combination encoding? That’s the key property we want from our bounded-length encoding.
176.
by bmc7505 4y ago
I am curious if there is a similar bijection for mapping all subsets whose size is at most k with the natural numbers? The problem of minimally representing bounded-cardinality subsets is mentioned briefly under “Open Questions”, but I wa
177.
A maximally-dense encoding for n-choose-k (2013)(farside.org.uk)
58 points by bmc7505 4y ago|28 comments
178.
by bmc7505 4y ago
Author here. You are very kind, but Kotlin∇ is definitely a work-in-progress and its claimed contributions are more modest in nature. It is true that Kotlin∇ was one of the first AD frameworks to introduce shape-safe tensor arithmetic, howe
179.
by bmc7505 4y ago
ML really is a beautiful and under-appreciated family of languages. Haskell is a bit too supernatural for my taste, but ML and its derivatives hit the sweet spot between powerful type systems and natural syntax. As a Kotlin developer, I fin
180.
Two dozen proofs until BB(5,2) is resolved(github.com)
2 points by bmc7505 5y ago|1 comments

More ›