Discussion:Lambda counting

Current semaphore

Attribution of the work currently being done (this is a semaphore !)

Rene:

• introduction

Christophe:

• the lower and upper bound for size 0 variables

Kasia:

• the result about closed-term (and much more)

Marek:

Jakub:

Guillaume:

• known results for Turing machines and cellular automata

Reservation of future semaphore

Rene:

Christophe:

Kasia:

• generating function

Marek:

Jakub:

Guillaume:

About the lower bound

The lower bound can probably be improved by replacing Catalan with the sum of Mtzkin M(n,k) for k between 0 and n/ln(n). This probably would give the same exponential factor for the lower and upper bound and get us nearer to an equivalent. Is it worth it ?