3378 search results - page 120 / 676 » A universe of binding and computation |
MLQ
2007
14 years 9 months ago
2007
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
CSL
2010
Springer
14 years 11 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Lecture Notes
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007
194
click to vote
Book
"These are the lecture notes accompanying the course Introduction to Functional
Programming, which I taught at Cambridge University in the academic year 1996/1997."
Presentation
Presented at First Electrical Science Divisional Symposium, Indian Institute of Science.
This is joint work with Prof David Parkes, Harvard University.