A Note on Recursively Enumerable Sets and Computable Functions
碩士 === 國立中正大學 === 哲學所 === 97 === The main goal of this thesis is to survey the theorems and properties related to recursively enumerable function, and rephrase or reorganize these theorems and properties. In Chapter one, I will first explain the concept of ``computable'' in an intuitive wa...
Main Authors: | Chao-Wei Chen, 陳昭瑋 |
---|---|
Other Authors: | Hsing-Chien Tsai |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96648458207305269166 |
Similar Items
-
E-recursively enumerable degrees
by: Griffor, Edward R.
Published: (2005) -
Concerning d-recursively enumerable sets and s-reducibility of #SIGMA#2̲ sets
by: Watson, P. R.
Published: (1988) -
The structure of the recursively enumerable Turing degrees
by: Eriksson, Lovisa
Published: (2021) -
Recursive determination of the enumerator for sums of three
squares
by: John A. Ewell
Published: (2000-01-01) -
Efficient extraction of canonical spatial relationships using a recursive enumeration of k-subsets
by: Hinselmann Georg, et al.
Published: (2010-05-01)