Hacker News: daivd

Using Pytorch and Pyro to Prove Poland Was Robbed at the 2018 Chess Olympiad

daivd — Tue, 20 Nov 2018 13:46:41 +0000

Article URL: https://tenfifty.io/probabilistic-programming-proves-poland-was-robbed-in-chess/

Comments URL: https://news.ycombinator.com/item?id=18493719

Points: 3

# Comments: 0

New comment by daivd in "Ask HN: What essay/blogpost do you keep going back to reread?"

daivd — Sun, 08 Oct 2017 10:18:57 +0000

Thanks for this one. Extremely well written.

New comment by daivd in "Ask HN: Do you keep a personal journal?"

daivd — Fri, 27 Jan 2017 09:54:24 +0000

I also use org-mode for my daily journal. Have been for about a year and I'm very happy with it. I used to use Evernote, but I like the idea of keeping it to myself with encrypted backups better.

Awesome-aleph-0: A curated list of recursively self-referring curated lists

daivd — Wed, 21 Oct 2015 12:24:56 +0000

Article URL: https://github.com/gurgeh/awesome-aleph-0

Comments URL: https://news.ycombinator.com/item?id=10424930

Points: 2

# Comments: 0

New comment by daivd in "Announcing the D-Wave 2X Quantum Computer"

daivd — Fri, 21 Aug 2015 10:39:43 +0000

It is not a conventional quantum computer. You cannot use it to factor numbers. You use it to find approximate solutions to optimization problems.

New comment by daivd in "Ubuntu 14.04 LTS (Trusty Tahr) Final Beta released"

daivd — Fri, 28 Mar 2014 10:58:07 +0000

I have never quite understood all these desktop emotions. I run Kubuntu, but almost never interact with any desktop features. What is it in your workflow that requires you to interact with Gnome/Unity? (just curious)

New comment by daivd in "Online executable Python solution to the Tuesday boy problem"

daivd — Sat, 11 Jan 2014 09:58:56 +0000

I whipped together something here, before I saw that someone else did it too: http://ideone.com/jyPOhs

It is the most counter-intuitive statistic problem I know (worse than Monty Hall), it trips everyone up at first.

No problem about the stubborness ;)

New comment by daivd in "Online executable Python solution to the Tuesday boy problem"

daivd — Fri, 10 Jan 2014 22:43:20 +0000

The wiki article is not valid, since it considers a subtly different problem than the one I do. If you read the comment at the top of the code, you will see that I changed the question to be less ambiguous.

In the problem I pose, the person does not randomly come forward and tell me "I have a boy born on a tuesday". In my problem I ask random people who I know have two children if they have "at least on boy born on a tuesday" until someone says yes.

New comment by daivd in "Online executable Python solution to the Tuesday boy problem"

daivd — Fri, 10 Jan 2014 21:44:02 +0000

Actually you are still wrong.

Try something easier, for example two dice. The probability to roll 1 1 is less than to roll 1 2, because 1 2 can be rolled either by first rolling a 1 or a 2, while 1 1 can be rolled only by first rolling a 1. That information is used often in dice games like backgammon.

Same with children: BT BT can only be "rolled" if your first child is BT, whil BT BW can be "rolled" if your first child is either BT or BW.

Do you see?

New comment by daivd in "Online executable Python solution to the Tuesday boy problem"

daivd — Fri, 10 Jan 2014 11:52:34 +0000

No, it does not exclude that possibility (print the final list of pairs if you want to check). The calculation is correct. The result is counter-intuitive to almost everyone, which is why I made the program, so you can convince yourself.

Online executable Python solution to the Tuesday boy problem

daivd — Fri, 10 Jan 2014 10:38:07 +0000

Article URL: http://ideone.com/qmcjVy

Comments URL: https://news.ycombinator.com/item?id=7036008

Points: 2

# Comments: 10

New comment by daivd in "102TB of New Crawl Data Available"

daivd — Thu, 28 Nov 2013 15:41:08 +0000

One subset for each TLD would be nice. Or, if you can afford more CPU-power, per language, using a good open language detector.

New comment by daivd in "Poll: According to you how much the value of bitcoin will be after 6 months?"

daivd — Wed, 27 Nov 2013 09:58:17 +0000

I have a fundamental issue with bitcoins that I have not seen anyone address. Sooner or later a better bitcoin will be invented. One that can perform transactions faster, or is more anonymous or where mining for the coin helps some nice project (SETI@home, math proofs, protein folding, etc), or something completely different. When an alternative better currency catches on, at some point it will become obvious that bitcoins will be obsolete and the value should suddenly be 0 again.

It is the nature of technology that bitcoins will someday become MySpace.

I am open to be convinced otherwise by someone knowledgeable.

New comment by daivd in "Tesla's $110,000 Model S is now Norway’s best-selling car"

daivd — Wed, 09 Oct 2013 09:56:22 +0000

No, you are correct. The oil money is hardly spent at all. It is invested for future security.

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Wed, 18 Sep 2013 12:31:14 +0000

I agree that syntax is more important than us "rational" programmers like to let on. The syntax will be similar to Python, but nothing fantastic.

I think switching the usual meaning of = and == will be confusing. O'Caml uses = and == for deep and shallow comparison respectively and <- for assignment. That is a possibility.

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Tue, 17 Sep 2013 14:01:02 +0000

I plan to sneak in something similar with a capable type system and contracts for stuff that you can't express in the types. That way you could "one day" use a solver like Z3 and start proving or disproving some of the tractable contracts, without having to even change the programs. A bit like LiquidHaskell.

Not exactly dependent types, but practical, I think.

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Tue, 17 Sep 2013 13:04:01 +0000

Thanks for the list of related projects!

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Tue, 17 Sep 2013 12:23:45 +0000

1. Yes, the linear typing for mutable data is inspired by Clean. 2. I look at Shen from time to time. It looks nice, but I have never gotten around to play with it.

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Tue, 17 Sep 2013 12:13:33 +0000

I do like an expressive high-level encoding like that, but 1) I just needed a silly example to show what pipes are. In practice you would probably use higher-order library functions (or components) like group for the same thing. 2) In my experience, very compressed expressions can be hard to modify in certain directions. Practical stuff like printing, logging or storing progress every X seconds, which is a small modification in a for-loop, can be a hassle.

New comment by daivd in "Big Programming, Small Programming – Glow, the language"

daivd — Tue, 17 Sep 2013 10:34:52 +0000

If Internet comments were always this encouraging, the world would be a better place :).