Theory of Computation, Turing Machine (Hiking in Modern Math 1/7)

By Lê Nguyên Hoang, Not an Ordinary Seminar, GERAD.

For one hour, I will take you through some of the most amazing recent subfields of mathematics. From computational theory to chaos theory, from infinity to ergodicity, from mathematical physics to category theory, we will be unveiling mind-blowing results of modern mathematics. Although primarily aimed at non-mathematicians, it should be of great interest to everyone.

More on Science4All

Complexity Theory, P versus NP, RSA Cryptography (Hiking in Modern Math 2/7) Complexity Theory, P versus NP, RSA Cryptography (Hiking in Modern Math 2/7)
By Lê Nguyên Hoang | Updated:2016-02 | Views: 1265

Self-Reference, Math Foundations and Gödel's Incompleteness Self-Reference, Math Foundations and Gödel's Incompleteness
By Lê Nguyên Hoang | Updated:2016-02 | Views: 3307
Although highly appreciated by artists, self-reference has been a nightmare for mathematicians. It took one of the greatest, Kurt Gödel, to provide a better understanding of it. This article deals with paradoxes, recursion, fractals and Gödel's incompleteness theorems.

P versus NP: A Crucial Open Problem P versus NP: A Crucial Open Problem
By Lê Nguyên Hoang | Updated:2016-01 | Views: 5542
P=NP is probably today's most crucial open problem. Not only is it a very theoretical question in computer science and mathematics, but it also has major implications to real world. Its resolution could revolutionize the world. This article gives the definition and major results of P=NP.

Leave a Reply

Your email address will not be published. Required fields are marked *