beza1e1 | 14 years ago | on: The exercise habit
beza1e1's comments
beza1e1 | 14 years ago | on: The exercise habit
beza1e1 | 14 years ago | on: The exercise habit
beza1e1 | 14 years ago | on: Meetings.io - Simple, online meetings
However, the problem seems to be an inherently social one. I cannot imagine any etherpad plugin or something to help with this.
beza1e1 | 14 years ago | on: Meetings.io - Simple, online meetings
The meeting starts with a document containing the agenda. Now everybody chats and rewrites the agenda into a protocol of the decisions made. Meeting ends.
Pros: The discussion is usually clearer, because you talk about text. No need to talk about old protocols, which are written afterwards.
Cons: Does not solve the problem that usually nobody feels responsible afterwards.
beza1e1 | 14 years ago | on: C Finally Gets A New Standard
beza1e1 | 14 years ago | on: Side Project: 1 Month, $10,000
beza1e1 | 14 years ago | on: Side Project: 1 Month, $10,000
beza1e1 | 14 years ago | on: Be Specific (especially during PG's office hours)
beza1e1 | 14 years ago | on: I hereby resign
beza1e1 | 14 years ago | on: Lisp Hackers: Marijn Haverbeke
beza1e1 | 14 years ago | on: The truth about Scala
beza1e1 | 14 years ago | on: RESTful thinking considered harmful
beza1e1 | 14 years ago | on: RESTful thinking considered harmful
/orders/42 # with { order: { paid: true } }
And it returns the /orders/42/payment transaction resource.beza1e1 | 14 years ago | on: A Better Strategy for Hangman
More precisely: Given a dictionary of all possible words and a letter to guess, we can split the dictionary into k parts. One sub-dictionary contains all words for which the answer is negative. Additionally, we have k-1 sub-dictionaries for each equivalence class of letter positions.
For each letter, we can compute the partition. Now we need to choose the strategically best partition. I believe it should be the one with "the lowest average sub-dictionary size".
beza1e1 | 14 years ago | on: Lout: An alternative to LaTeX?
beza1e1 | 14 years ago | on: A Better Strategy for Hangman
Actually, we should be correct 50% of the time. Which means 22 Bits of information or 4194304 words.
Additionally, we know the length of the word.
The english dictionaries seem to have between 400k and 1000k words [0] of all word sizes. With 22 Bits we get 4000k words. We do not have to worry about getting hanged using the information-reduction algorithm. ;)
beza1e1 | 14 years ago | on: A Better Strategy for Hangman
beza1e1 | 14 years ago | on: XeTeX: could it be TeX's saviour?
beza1e1 | 14 years ago | on: Lout: An alternative to LaTeX?
Why do people prefer to run for hours instead of a more intensive workout in a minutes?
Looking at the typical runners [0], why would you desire a physique like that?
[0] http://diaryofakalechic.files.wordpress.com/2011/08/marathon...