Explore >> Select a destination


You are here

dustingmixon.wordpress.com
| | terrytao.wordpress.com
12.4 parsecs away

Travel
| | Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a Polymath project on the topic of obtaining new upper bounds on the
| | gilkalai.wordpress.com
12.7 parsecs away

Travel
| | A major progress on an old standing beautiful problem.Aubrey de Grey proved that the chromatic number of the plane is at least 5. (I first heard about it from Alon Amit.) TheHadwigerNelson problem asks for the minimum number of colors required to color theplanesuch that no twopointsat distance one from each other have the
| | polymathprojects.org
8.2 parsecs away

Travel
| | The Hadwiger-Nelson problem is that of determining the chromatic number of the plane ($latex \mathrm{CNP}$), defined as the minimum number of colours that can be assigned to the points of the plane so as to prevent any two points unit distance apart from being the same colour. It was first posed in 1950 and the...
| | coornail.net
39.3 parsecs away

Travel
| Neural networks are a powerful tool in machine learning that can be trained to perform a wide range of tasks, from image classification to natural language processing. In this blog post, well explore how to teach a neural network to add together two numbers. You can also think about this article as a tutorial for tensorflow.