bmc7505

27 ms·

301.
by bmc7505 6y ago
Just because the current implementation of the Idris type checker always terminates due to the size change termination heuristic does not mean that type checking Idris is decidable. If the type system as specified allows an author to expres
302.
by bmc7505 6y ago
PDF: http://bd.unsl.edu.ar/download.php?id=1638
303.
by bmc7505 6y ago
Curiously, the author "Jay Riverlong" doesn't appear to exist prior to a month ago, right around the time when GPT-3 came out. For a "professional poker player" who "travelled extensively throughout South Ameri
304.
by bmc7505 6y ago
Hey, thanks for your comment! I'm a big fan of DIY "implementers" like yourself and am happy to hear some of these ideas resounded with you. I come from a similar background, and agree we need better tools for thinking and wo
305.
by bmc7505 6y ago
Agreed, the biographical details are not super relevant would help to have a ToC. I have added one to the intro. Thanks for reading!
306.
by bmc7505 6y ago
Interesting! I was not aware of the connection to Chu spaces, will have a look into that! Algebraic topology seems to have a endless trove of many interesting dualities. I did find the connection between topological ordering and boolean mat
307.
by bmc7505 6y ago
Hi HN, author here! This post discusses some research I and my colleagues at McGill have been working on recently, borrowing ideas from graph theory and linear algebra to model computation. If any of these topics interests you, feel free dr
308.
Computation Graphs and Graph Computation(breandan.github.io)
109 points by bmc7505 6y ago|37 comments
309.
Computation Graphs and Graph Computation(brea.ndan.co)
3 points by bmc7505 6y ago|0 comments
310.
Computation Graphs and Graph Computation(breandan.net)
3 points by bmc7505 6y ago|0 comments
311.
Automating Abstract Interpretation(youtube.com)
2 points by bmc7505 6y ago|0 comments
312.
AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity(arxiv.org)
1 points by bmc7505 6y ago|0 comments
313.
DreamCoder: Growing generalizable, interpretable knowledge with program learning(arxiv.org)
4 points by bmc7505 6y ago|0 comments
314.
by bmc7505 6y ago
Shameless plug, but I have been working on an open source IDE plugin [1] for the IntelliJ Platform which attempts to do this. Previously, we used an older HMM-based speech toolkit called CMUSphinx [2], but are currently transitioning to a d
315.
by bmc7505 6y ago
"The basic tool for the manipulation of reality is the manipulation of words. If you can control the meaning of words, you can control the people who must use the words. George Orwell made this clear in his novel 1984. But another way
316.
AnyGen: Structural Language Models of Code(anycodegen.org)
3 points by bmc7505 6y ago|0 comments
317.
Potential organized fraud in ACM/IEEE computer architecture conferences(medium.com)
492 points by bmc7505 6y ago|193 comments
318.
by bmc7505 6y ago
Most CS programs skip the details of software engineering, such as Linux, command line, editors, IDEs. Maybe you can check out this course from MIT to get a head start: https://missing.csail.mit.edu
319.
Intergalactic Star(en.wikipedia.org)
3 points by bmc7505 6y ago|0 comments
320.
by bmc7505 6y ago
There was a discussion here the other day about the Seven Bridges of Königsberg, which is today known as a Eulerian path. [1] Unlike Eulerian paths, which are detectable in linear time [2], detecting Hamiltonian paths is NP-complete [3]. Do
321.
by bmc7505 6y ago
William Hamilton has an interesting variation of Euler's Seven Bridges puzzle [0] which asks whether there is a path visiting every vertex of a polyhedron exactly once. Strangely, while the complexity of detecting Eulerian paths is lin
322.
Vicarious Embarrassment(en.wikipedia.org)
2 points by bmc7505 6y ago|0 comments
323.
Genopolitics(en.wikipedia.org)
2 points by bmc7505 6y ago|0 comments
324.
Typilus: Neural Type Hints [pdf](miltos.allamanis.com)
1 points by bmc7505 6y ago|0 comments
325.
by bmc7505 6y ago
http://archive.is/6G8z9
326.
by bmc7505 7y ago
I just wish that Kotlin had a testing solution as great as Spock (groovy), or rspec for ruby, for that matter. Have you tried using Spek? [1]: https://github.com/spekframework/spek
327.
Programming Tools for Intelligent Systems [pdf](github.com)
3 points by bmc7505 7y ago|0 comments
328.
by bmc7505 7y ago
Keep writing! HN needs more thoughtful comments like yours.
329.
by bmc7505 7y ago
Interesting to contrast between the postmodern condemnation of aristocracy as fundamentally immoral and the Girardian view of aristocracy as a necessary safeguard to prevent memetic violence in society. > Lasting peace and harmony inhere
330.
by bmc7505 7y ago
If you enjoyed reading this, you might want to check out CodeBuff: https://github.com/antlr/codebuff CodeBuff is based on a paper by Terrence Parr and Juergen Vinju, “Towards a Universal Code Formatter through Machine

More ›