This is from work I did last year with class mates. It proved to be really interesting, and possibly the most interesting mathematical topic I ever encountered

ABSTRACT
Author: Professor John Dwyer

In computing, several rapidly-increasing functions are used in areas such as computability, algorithm analysis and tractability. These include Ackerman’s function, Dwyer’s function and Euler’s Gamma function. This paper investigates these functions and compares them asymptotically.

Abstract
In graph theory, a long standing problem has involved finding
a closed form expression for the number of Euler circuits in
Kn. The solution presented here comprises a function D(x,y)
that has several interesting applications in computing.

Welcome to my Blog!

Thanks for dropping by! Feel free to leave comments on anything you find useful...
You can stay updated by subscribing to the RSS feed, you can contact me by using the contact page, or you can Follow me on Twitter