Calendar

Oct
2
Fri
Achilles Beros: A diagonally non-computable function (II)
Oct 2 @ 9:30 am – 10:30 am
Oct
9
Fri
Mushfeq Khan: A slow-growing diagonally non-computable function that computes no effectively bi-immune set
Oct 9 @ 9:30 am – 10:30 am
Oct
16
Fri
Mushfeq Khan: A slow-growing diagonally non-computable function that computes no effectively bi-immune set II
Oct 16 @ 9:30 am – 10:30 am
Oct
23
Fri
Mushfeq Khan: A slow-growing diagonally non-computable function that computes no effectively bi-immune set
Oct 23 @ 9:30 am – 10:30 am
Nov
9
Mon
CCR submission deadline
Nov 9 all-day
Nov
24
Tue
Decision on submissions
Nov 24 all-day
Nov
30
Mon
The Complexity Option Game @ Watanabe 113
Nov 30 @ 9:30 am – 10:30 am

The on-line interactive Complexity Option Game allows players to test their intuition and knowledge of complexity and American options.

Its companion paper is “Pricing complexity options”, to appear in the journal Algorithmic Finance, joint with Math graduate Malihe Alikhani, and Shidler graduates Amir Pakravan and Babak Saadat.

The paper introduces a thought experiment: a financial derivative based on the complexity of a sequence of up and down ticks of a stock price.

The difficulty of succeeding in this game may be related to the phenomenon of bounded rationality, to be discussed by Lance Fortnow during the 11th International Conference on Computability, Complexity and Randomness, UH Manoa, January 4-8, 2016.


Event Sponsor
Mathematics, Manoa Campus

More Information
Bjørn Kjos-Hanssen, 9568595, bjoern.kjos-hanssen@hawaii.edu, http://math.hawaii.edu/wordpress/bjoern/software/web/complexity-option-game/

Dec
12
Sat
Final version due
Dec 12 all-day