newbye3

6 ms·

1.
by newbye3 4y ago
https://news.ycombinator.com/item?id=26708148 The service is only free until you reach their limit. The post has 166 comments.
2.
by newbye3 4y ago
I am 60 years old and as a person always learning I have accumulated a huge stack of knowledge and I think my mind is in a very good shape so I still can learn new things quickly. Long time ago I found a good balance between life and wo
3.
by newbye3 4y ago
My first impression is that a better algorithm is obtained with one vector for each hash function, but now I am lazy to do the math.
4.
by newbye3 4y ago
Don't hire me, this version cons a lot )): (defun palindrome(str) (string= str (coerce (reverse (coerce str 'list)) 'string))
5.
by newbye3 4y ago
Perhaps this is the kind of problem in which a macro system, like that in common lisp, allow you to solve the problem paying the prize in a little more compilation time but not in runtime.
6.
Ask HN: Is there a mountain pick view concept in Reinforcement Learning?
1 points by newbye3 4y ago|0 comments
7.
by newbye3 4y ago
At first sight, in the examples: inc1(7) pure, inc2(8) impure, what's the meaning of inc2? (some kind of increment?) Then in the definion of map there is an argument function f, and in the definition there is a new function g that come
8.
by newbye3 4y ago
in prolog the definition of path is something like: path(x,y) := edge(x,y). path(x,z) := edge(x,y),path(y,z). So to me it seems a little strange the definition of path in datalog from a prolog user point of view.
9.
by newbye3 4y ago
If you are using integers to represent subsets then int.bit_count is the number of elements of the set. There is a machine instruction to count the number of ones in the binary representation, maybe popcnt is the name, I am not sure. Edited