News for hackers. Stuff that matters.

onetwo12

Re:A gentle introduction to Prolog (2013) on Saturday October 08, 2016 @07:01PM (#12669109)
Prolog is only appropriate for certain kinds of programs, long time ago I programmed in prolog and it was a very difficult task when the problem was not about matching and unification.

For me Lisp was much more appropiate and easy to program. Forward chaining and unification is not enough for certain class of algorithms, sometime you need backward chaining, probabilistic inference and many other ideas that are not easily translated in prolog. I remember some discussion about the semantic of clauses. For example misil(ready), is this about the misil is already ready, or that you are going to prepare the misil, etc. I find that concurrency and paralelism in prolog are not easy. In the book "on Lisp" by P. Grahan there is a prolog interpreter in Lisp, this can be interesting for somebody wishing to learn prolog.

Edit,Added, erlang was inspired by prolog, so learning prolog will help you learn erlang, but if you are a ruby type elixir is your best option.

The post is about suggesting more fermi estimates problems, see for example http://lesswrong.com/lw/h5e/fermi_estimates/

Fermi estimates require you to look for relations in the real world, construct a model of the situation and then iterate improving the model by adding more information. You don't use that process just to give an example of using a rule or solving an equation, instead you emphasize how the problem could be tackle mathematically. So there are more room for open questions, incentives for exploring and suggesting new approaches, in a more relaxed atmosphere creativity can flourish, perhaps maths is more than a single equation written in an old book.

Re:Graph-Powered Machine Learning at Google on Saturday October 08, 2016 @05:13AM (#12666243)
I see this as a knn approach in which the distance is a function of the strength of the edge between the vertices.

In the retrofitting paper cited in the comments there is a process of smoothing, that is feeding back the message or information to update the states of the graph (example in the modern ai book). It doesn't seem anything new.

Re:Foundations of Data Science [pdf] on Friday October 07, 2016 @06:40PM (#12664489)
Your Monte Carlo post is interesting, but it doesn't consider the context of markov networks, for example reading Norvig Modern IA there are good examples. There is a subtle point that having probabilities locally you must prove that the global structure is a probability and this requires some order in the vertexes to propagate the information from the root to the leafs, also Markov models can have higher degree and then they are not like random walks. Anyway, the context of matrices and eigenvalues is interesting.
Re:Foundations of Data Science [pdf] on Friday October 07, 2016 @10:46AM (#12661041)
You can read similar to chapter two, high dimensional spaces, in https://jeremykun.com/2016/02/08/big-dimensions-and-what-you...

Also, chapter three about SVD, is in https://jeremykun.com/2016/04/18/singular-value-decompositio...

and https://jeremykun.com/2016/05/16/singular-value-decompositio...

the advantage is that you have the python code available.

https://jeremykun.com/2015/04/06/markov-chain-monte-carlo-wi...

The book seems to be interesting.