Two days ago, July 16th 2019, it was announced on BBC World Service that Bank of England will issue £50 bank notes with the portrait of Alan Mathison Turing, the good mathematician who saved millions of lives with his and his fiancee Joan Clarke’s work on breaking the German Enigma encryption during World War Two as portraited in the movie The Imitation Game.
On June 15th 2019 I completed my work in Mathematics Research with a very naïve claim that GNOME Internet Radio Locator beats Turing’s test in Artificial Intelligence with a Gettier counter-example argument, since there is no way to know if the radio streaming is broadcasting recorded or live.
My conclusion: The only way to gain new recommendations from a human being is to meet new people, expand your Social Graph, like I wrote in http://math.aamot.org/Global/SocialGraphs.pdf or listen to radio for new ideas.
I choose to meet new people.
In August 2015 I went to Berkeley, California and wrote a paper on a new web site called Piperpal. You can read about my work on the web site at https://www.piperpal.com/doc/2.0/piperpal-2.0.pdf
Given two geographical coordinates P(glat,glon) and Q(latpoint,longpoint), you can calculate the distance r between P and Q in meters with the following Haversine formula:
Check with other sources before you implement Haversine distance in your computer program.
In April 2015 I wrote a paper called Social Recommendations in Mathematics on a new social recommendation engine and the problems we face with modern Artificial Intelligence with lack of input from unknown people.
I was in the US for 3 weeks on the Visa Waiver program in 2015 and stayed at a friendly AirBnB host in Berkeley nearby the UC Berkeley campus.
While I was in Berkeley I decided to check out the course offerings at the UC Berkeley Extension student program and found the class COMPSCI X460 – Practical Machine Learning (With R) interesting.
I sent an email to UC Berkeley Extension team who showed me the web site where it was written that I as a tourist is permitted to study for recreation without credits at UC Berkeley Extension. If you want to study with credits in the US, you need a student VISA known as F-1.
- Your enrollment into UC Berkeley Extension course(s) must solely be for recreational purposes;
- Your course(s) must only be incidental to your visit as a tourist to the U.S., and must not be the main purpose of your visit;
- Your course(s) must not equal or exceed 18 instructional hours per week;
- Your course(s) must not equal or exceed:
- For courses numbered X300-499: 8 semester units a term; or
- For courses numbered X or XB 1-299: 12 semester units per term (including concurrent enrollment courses); and,
- Your course(s) must not be used for credit toward a degree, diploma, certificate or other program completion award.
I attended the first introduction class at UC Berkeley Extension in the Golden Bear Center, but didn’t continue with the class since I was in the US on the Visa Waiver program for 90 days and was going to return to Norway the day after the introduction class.
The curriculum for Practical Machine learning (With R) was Max Kuhn and Kjell Johnson’s Applied Predictive Modeling, but I could not find the text book in the campus book store. The book is available on Amazon.
Extra curriculum was Hastie, Tibshirani and Friedman’s Elements of Statistical Learning.
I am reading the linear algebra book “Google’s PageRank and Beyond – The Science of Search Engine Rankings” by Amy N. Langville & Carl D. Meyer on the math behind Google’s search engine.
In Chapter 4 the PageRank equation is presented.
$\pi^T = \pi^T ( \alpha S + ( 1 – \alpha ) E )$
Whenever a person meets another person, a vertice on the social graph, they will either ignore each other, talk to each other, occassionally talk to a new person, or be introduced to a person that isn’t yet in a vertice on their social graph, by a person on the social graph.
Yesterday I wrote my first letter to John Nash.
The Social Theorem (from my article “Social Graphs in Mathematics“, on Paul Erdős, John Nash, and Bertrand Russell, not surprisingly rejected by Notices of the American Mathematical Society in 2009 because it didn’t end with a conclusion, and then printed on my own cost and distributed) goes something like this:
Whenever a mathematician meets another mathematician in a point on the social graph, they will either ignore each other, produce a new proof, occasionally a new mathematician, or deﬁne a new conjecture.
My conclusion in 2014 after visiting MIT is:
Expand your social graph.