
This volume contains the proceedings of the AMS Special Sessions on Algorithmic Probability and Combinatories held at DePaul University on October 56, 2007 and at the University of British Columbia on October 45, 2008.
This volume collects cuttingedge research and expository on algorithmic probability and combinatories. It includes contributions by wellestablished experts and younger researchers who use generating functions, algebraic and probabilistic methods as well as asymptotic analysis on a daily basis. Walks in the quarterplane and random walks (quantum, rotor and selfavoiding), permutation tableaux, and random permutations are considered. In addition, articles in the volume present a variety of saddlepoint and geometric methods for the asymptotic analysis of the coefficients of singleand multivariable generating functions associated with combinatorial objects and discrete random structures. The volume should appeal to pure and applied mathematicians, as well as mathematical physicists; in particular, anyone interested in computational aspects of probability, combinatories and enumeration. Furthermore, the expository or partly expository papers included in this volume should serve as an entry point to this literature not only to experts in other areas, but also to graduate students. 


