For more information about this meeting, contact Stephen Simpson, Jan Reimann.
| Title: | Descriptive Complexity of Brownian Motion |
| Seminar: | Logic Seminar |
| Speaker: | Adrian Maler, Pennsylvania State University |
| Abstract: |
| A Brownian motion is generic if it satisfies every suitably
effective event of probability one. A generic Brownian motion can be
approximated by finite random walks of high computational
complexity. There is a recursive isomorphism between generic Brownian
motions and Martin-Lof random reals. |
Room Reservation Information
| Room Number: | MB315 |
| Date: | 09 / 18 / 2012 |
| Time: | 02:30pm - 03:45pm |