Back to Results
First PageMeta Content
Mathematics / Mathematical logic / Recursively enumerable set / Primitive recursive function / Recursion / Diophantine set / Μ operator / Computability / Recursive set / Computability theory / Theoretical computer science / Theory of computation


Recursion Theory Frank Stephan October 8, 2012 Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) could be defined effectively and how
Add to Reading List

Document Date: 2012-10-08 00:46:12

Open Document

File Size: 844,52 KB

Share Result on Facebook

City

Alexandria / /

Country

Egypt / /

/

Facility

Computer Science National University of Singapore / /

IndustryTerm

earliest algorithm / exhaustive search strategy / possible solutions / exhaustive search / unbounded search / /

Organization

International Congress / National University of Singapore / /

Person

Alan Turing / Chong Chi Tat / David Hilbert / Andrew Wiles / Church / Pierre de Fermat / Yang Yue / Frank Stephan / /

/

Position

author / mathematician / /

ProgrammingLanguage

Java / Fortran 77 / C / /

Technology

earliest algorithm / following algorithm / Java / dom / /

URL

http /

SocialTag