First Page | Document Content | |
---|---|---|
Date: 2009-08-14 07:09:04Theoretical computer science Theory of computation Computability theory Mathematics Turing machine Alan Turing Models of computation Ambient calculus Turing completeness Halting problem Computability Reduction | Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗Add to Reading ListSource URL: www.doc.ic.ac.ukDownload Document from Source WebsiteFile Size: 484,90 KBShare Document on Facebook |
Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ranDocID: 1sWjT - View Document | |
In pursuit of decidable ‘logical form’ Michael Minock TCS/CSC KTH Royal Institute of Technology, Stockholm, Sweden AbstractDocID: 1rsvH - View Document | |
Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3DocID: 1rozw - View Document | |
A brief introduction to Higher Order Logic and the HOL proof assistant Monica NesiDocID: 1rjEK - View Document | |
Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549DocID: 1rjw8 - View Document |