Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 26, 2011, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Thomas Rast

Buffon machines

Buffon (1777) posed the famous needle experiment: throw a unit needle randomly onto an infinite sheet of paper with parallel lines at unit intervals. Then the probability of the needle intersecting a line is 2/pi. It can be considered as taking continuous random inputs and giving {0,1} output (termed "failure" and "success") with certain probabilities.

Flajolet, Pelletier and Soria (SODA11) transformed this into a more combinatoric setting by considering *Buffon machines* which are allowed only coin-flip randomness inputs. The goal is to make the probability of success some interesting number, such as 1/e, 1/pi, erf(x) or zeta(3). This surprisingly is possible with very short programs and a low expected number of coin flips, e.g., in the case of pi/12 less than 5 (!).

We will give an introduction to the setting and an overview of the constructions done by Flajolet et al. Then, time permitting, we will look at a few constructions in more detail. Text

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login