bmc7505

21 ms·

211.
by bmc7505 5y ago
This is useful information, thank you for sharing this theorem! I am still skeptical about the soundness of the verifier's challenge generating mechanism. Assuming P!=NP and the challenge is drawn uniformly from the full space, I am st
212.
by bmc7505 5y ago
One thing I do not understand and would like to learn more about is zero-knowledge proofs is that their soundness seems to rest on the data-generating mechanism. Suppose you had an adversary Alice who claims to possess a constructive proof
213.
by bmc7505 5y ago
I previously used IntelliJ IDEA on Linux for over eight years, so I can sympathize with your struggles. [1] Recently I started using OSX because my Thinkpad finally died and I could not find another laptop I liked. So far, it's been pr
214.
by bmc7505 5y ago
I am sorry to hear about your productivity issues. I also experienced some slowness in recent builds, although I think our issues are not directly related, since I primarily use IntelliJ IDEA and not PyCharm. Following a recent issue I enco
215.
by bmc7505 5y ago
It is recommended to use the currently bundled JBR version (JDK 11). Although later versions are available for testing, they are less stable as the author of this blog post mentions at the end.
216.
Advances in Programming Languages and Neurosymbolic Systems(aiplans.github.io)
6 points by bmc7505 5y ago|0 comments
217.
by bmc7505 5y ago
Looks like it uses Log4j: https://github.com/prevayler/prevayler/blob/f52736da5a2d7d87...
218.
by bmc7505 5y ago
Again, I would put it very differently. Despite having a fraction of the audience and resources of a multi-trillion-dollar company, and despite a long list of competing languages, JetBrains had the foresight to invest and innovate in the la
219.
by bmc7505 5y ago
For the record, Kotlin was open sourced Feb. 13th, 2012 [1]. Swift was open sourced Dec. 3rd, 2015 [2]. So while the first commits happened just a few months apart [3, 4] and these languages may have shared similar influences, Kotlin predat
220.
by bmc7505 5y ago
> The double pendulum is not "unexplainable" or "inexplicable behavior", in fact is is explained very well in this very article. It just requires an infinite degree of precision if you desire to simulate it numericall
221.
Fleet, a Lightweight IDE from JetBrains(blog.jetbrains.com)
718 points by bmc7505 5y ago|414 comments
222.
Dubins Path(en.wikipedia.org)
1 points by bmc7505 5y ago|0 comments
223.
by bmc7505 5y ago
AceJump co-author here. Thank you for the suggestion! If you are curious, you can learn more about some of the unique features AceJump offers and how it compares with similar implementations here: https://github.com/acejump&
224.
by bmc7505 5y ago
I have often wondered whether the eigenvector of political orientation being low-dimensional (e.g. left-right, conventional-independent) is somehow related to bicameralism (i.e. which side has executive function). It seems like the struggle
225.
by bmc7505 5y ago
One of the authors of this work apparently now works on supercompilers at Meta and open sourced some nice tools for equivalence checking based on graph rewriting [1] and constructive type theory [2]. If you're interested in that kind o
226.
After Virtue: A Study in Moral Theory (1981)(lib.tcu.edu)
1 points by bmc7505 5y ago|0 comments
227.
by bmc7505 5y ago
I don't really understand how terms like "moral" or "faithful" came to be adopted in mathematical parlance. I understand these words are intended to convey some technical meaning, but why muddy the waters between &#
228.
Poincaré, Heisenberg, Gödel and the limits of scientific knowledge(arxiv.org)
86 points by bmc7505 5y ago|43 comments
229.
Conservatism Is Dead(treeofwoe.substack.com)
2 points by bmc7505 5y ago|0 comments
230.
Programming in the Age of Intelligent Machines(breandan.net)
3 points by bmc7505 5y ago|0 comments
231.
by bmc7505 5y ago
We don't have the words to describe how quickly these nonlinear recurrence relations grow. Many program synthesis problems are essentially super-exponential. Look at the Ackermann function, which describes the complexity of many decida
232.
by bmc7505 5y ago
There are two answers to your question. One is, humans have simply not found very good solutions in these spaces. We have designed algorithms which barely work on denumerable sets, but are unsuitable in more general spaces. There are many d
233.
by bmc7505 5y ago
There is a vast chasm of computational complexity between Chess, Go, and protein folding, to program induction. Unlike problems where the configuration space grows exponentially, the space of valid programs is at least super-exponential and
234.
by bmc7505 5y ago
While there are those in the AI community who believe scaling laws will unearth such programs, they are deluded. There are problems which scale faster than our computational resources allow, even if hardware scaling continues unabated for m
235.
Advances in Programming Languages and Neurosymbolic Systems(aiplans.github.io)
3 points by bmc7505 5y ago|0 comments
236.
On the economy of doing mathematics [pdf](cs.utexas.edu)
3 points by bmc7505 5y ago|0 comments
237.
On the cruelty of teaching computing science(cs.utexas.edu)
5 points by bmc7505 5y ago|0 comments
238.
by bmc7505 5y ago
I see. The Ph.D. route is not an easy one, and you should think carefully whether it is what you really want. However I would not assume that less-than-perfect grades are an insurmountable barrier. More importantly, you must be persistent a
239.
by bmc7505 5y ago
I disagree, but I admit that I may be biased. I know plenty of folks whose grades were not perfect, but were determined and had a clear idea of what they wanted to study. However there is some degree of bureaucracy involved, so you must be
240.
by bmc7505 5y ago
I have more interest in type systems and programming language theory and things like that. I was in your shoes a few years ago. Have you thought about grad school? If you don't mind the cold, you should consider applying to som

More ›