First Page | Document Content | |
---|---|---|
![]() Date: 2008-06-20 18:07:53Computer science Church–Turing thesis Computable function Turing reduction Primitive recursive function Recursively enumerable set Effective method Computability Turing machine Computability theory Theoretical computer science Theory of computation | Source URL: www.people.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 285,41 KBShare Document on Facebook |
![]() | A brief introduction to Higher Order Logic and the HOL proof assistant Monica NesiDocID: 1rjEK - View Document |
![]() | Al-Kashi’s constant τ Peter Harremoës March 3, 2012 Here I collect some facts about al-Kashi’s constant that was appearently fist used by the Persian mathematician Jamshid al-Kashi. A previous version of this pageDocID: 1qBvi - View Document |
![]() | Formal Development with ABEL ∗ Ole-Johan Dahl and Olaf Owe Department of InformaticsDocID: 1q22a - View Document |
![]() | The Theory behind TheoryMine Alan Bundy School of Informatics, University of Edinburgh, Edinburgh EH8 9AB, Edinburgh, Scotland. Lucas DixonDocID: 1pWca - View Document |
![]() | A Statically Allocated Parallel Functional Language Alan Mycroft1,2 and Richard Sharp2 1 Computer Laboratory, Cambridge UniversityDocID: 1oW2a - View Document |