Inufu

From the article this sounds exactly like my experience playing code golf - coming up with a cool solution, finding out your friend did it in half as many characters, completely reinventing your approach, repeat.

We are also doing an AMA on reddit tomorrow: https://www.reddit.com/r/MachineLearning/comments/76xjb5/ama...

Did you read the article? It's whole argument is that housing in Japan is much cheaper than other cities.

Sure, but if you want to actually check for some error condition (say distinguish between file opened ok, file not found, or some other error) - which is the whole point of having an error type to begin with, otherwise you could just use optional - you still have to look up the definition of the actual error type used every time.

A standardized error type used by everything removes that need - I know I can just call util::IsNotFoundError(..), no matter which library I'm using.

My main gripe with Rust so far has been the unnecessary profusion of Result<> types, making it hard to process and forward errors.

Case in point: the example in the article from the rust documentation that converts errors to strings just to forward them: https://doc.rust-lang.org/book/error-handling.html#the-limit...

In practice, I find a type like Google's util::StatusOr (https://github.com/google/lmctfy/blob/master/util/task/statu...) a lot easier to use (I've written >100kloc c++ using it). This uses a standardized set of error codes and a freeform string to indicate errors. I've yet to encounter a case where these ~15 codes were insufficient: https://github.com/google/lmctfy/blob/master/util/task/codes...

It looks like what you are actually timing is the time it takes to start a process - time for either communication method should be on the order of microseconds or less. For better results, start the two processes first, then measure how long it takes to send a message from process a to b and back to a.

Get a broker account in the country you are living in, then buy Vanguard index funds, e.g. VOO (or local version thereof).

tl;dr: Don't use Either<L, R> for error handling, it's too general. Use StatusOr<T>.

More details: http://www.furidamu.org/blog/2017/01/28/error-handling-with-...

In my experience (Austria and UK), lunch break is part of the 8h, i.e. I get to work at 10:00 and leave at 18:00.

There's a good chance that anything on RT is either false or presented in a very misleading way - they are a propaganda outfit for the Kremlin after all.

See eg. http://www.economist.com/blogs/graphicdetail/2016/09/daily-c... or http://www.spiegel.de/international/business/putin-fights-wa...

Presumably the probability density function, https://en.wikipedia.org/wiki/Probability_density_function

The expense ratio for VFINX is 0.16%, compared to average yearly returns of 6%.

Over 30 years, that's the difference between 5.74x and 5.48x your starting capital. Noticeable, but insignificant compared to the taxes you'll pay.

Both YouTube and Netflix usually have local caches, so it's not surprising that popular content plays fine.

C++ and Lua.

I'd love to put it on a public go server and will try to convince people :) However, this will have to wait until after the match in March, that's our number 1 priority at the moment.

There are graphs in the paper showing how it scales with more hardware.

There will be a live broadcast on our YouTube channel, I think the date will be announced soon.

The games were all played on separate days. As Fan Hui mentioned in the video, he changed his strategy after the first game to fight more, so that may explain why it seems his performance changed.

The version of AlphaGo used in the paper beats CrazyStone about 99% of the time. Even if we give CrazyStone 4 stones handicap, AlphaGo still beats it 80% of the time.

Our paper: http://www.nature.com/nature/journal/v529/n7587/full/nature1...

Video from Nature: https://www.youtube.com/watch?v=g-dKXOlsf98&feature=youtu.be

Video from us at DeepMind: https://www.youtube.com/watch?v=SUbqykXVx0A

edit: For those saying it's still a long way to beat the strongest player - we are playing Lee Sedol, probably the strongest Go player, in March: http://deepmind.com/alpha-go.html. That site also has a link to the paper, scroll down to "Read about AlphaGo here".

If you want to view the sgfs in a browser, they are in my blog: http://www.furidamu.org/blog/2016/01/26/mastering-the-game-o...

More context: http://www.bbc.co.uk/news/technology-35420579

Video from Nature: https://www.youtube.com/watch?v=g-dKXOlsf98&feature=youtu.be

Video from us at DeepMind: https://www.youtube.com/watch?v=SUbqykXVx0A

tl;dr: We beat a professional Go player 5:0 in even games, something previously thought to be 10 years away.

I'll just say: Mastering the game of Go with deep neural networks and tree search - http://www.nature.com/nature/journal/v529/n7587/full/nature1...

I think you missed the point. Of course you'd never implement add_one that way, but at some point you'll have a function where you want to pass a unique_ptr as an argument, and then your code will happily continue to compile even if you use the pointer after the move.

If you are outside of the USA: https://vid.me/search?q=last%20week%20tonight%20government

Angular can use Polymer components.

I work for Google, so not really concerned about the privacy of Drive.

The main reason why I don't want to use Evernote is because I want to store my notes in plain text files, so I can keep using them even in say 50 years.

Not necessarily - the main reason why I don't want to store my notes with Evernote is because I want to be able to use them in 50 years, not because I'm opposed to sync them with a 3rd party server.

I'm not that excited by Lavema, but it lead me tagspaces (http://www.tagspaces.org/), which seems much more awesome.

It just saves to your local filesystem, so you can sync with drive or dropbox if you want, layer some encryption in between with fuse. There's a mobile client, but you'll have to keep the note directory synced manually with a 3rd-party app.

It would be awesome if there was a way to specify my knowledge in certain fields, and filter out all courses that are too basic. As an example, I'm not interested in seeing dozens of "Introduction to Computer Science" courses, but I would be interested in a more advanced course on Artificial intelligence.