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 Website File Size: 484,90 KBShare Document on Facebook
|