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: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/96648458207305269166 |
id |
ndltd-TW-097CCU05259006 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-097CCU052590062016-05-04T04:26:06Z http://ndltd.ncl.edu.tw/handle/96648458207305269166 A Note on Recursively Enumerable Sets and Computable Functions 遞迴可數集與可計算函數之概論 Chao-Wei Chen 陳昭瑋 碩士 國立中正大學 哲學所 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 way, and then describe two different formal ways to define computability: by (partial) recursive functions or by Turing computable functions. I will look into the recursive function approach and introduce some basic results of it. Two important relevant concepts, recursively enumerable sets and index sets will also be introduced in this chapter. I will then show that several problems are unsolvable. In chapter two, I will focus on recursively enumerable sets and the Recursion Theorem. Two different definitions of recursively enumerable sets and some basic properties of $r.e.$ sets will be presented. Then I will show some properties for recursive sets and finite sets. Finally, I will present the proof of Recursion Theorem as well as the proofs for Recursion Theorem with parameters and Recursion Theorem for partial recursive functions. And then several applications of Recursion Theorem will be given. Hsing-Chien Tsai 蔡行健 2009 學位論文 ; thesis 48 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中正大學 === 哲學所 === 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 way,
and then describe two different formal ways to define computability:
by (partial) recursive functions or by Turing computable functions.
I will look into the recursive function approach and introduce some basic results of it.
Two important relevant concepts,
recursively enumerable sets and index sets will also be introduced in this chapter.
I will then show that several problems are unsolvable.
In chapter two,
I will focus on recursively enumerable sets and the Recursion Theorem.
Two different definitions of recursively enumerable sets
and some basic properties of $r.e.$ sets will be presented.
Then I will show some properties for recursive sets and finite sets.
Finally,
I will present the proof of Recursion Theorem as well as the proofs for
Recursion Theorem with parameters and Recursion Theorem for partial recursive functions.
And then several applications of Recursion Theorem will be given.
|
author2 |
Hsing-Chien Tsai |
author_facet |
Hsing-Chien Tsai Chao-Wei Chen 陳昭瑋 |
author |
Chao-Wei Chen 陳昭瑋 |
spellingShingle |
Chao-Wei Chen 陳昭瑋 A Note on Recursively Enumerable Sets and Computable Functions |
author_sort |
Chao-Wei Chen |
title |
A Note on Recursively Enumerable Sets and Computable Functions |
title_short |
A Note on Recursively Enumerable Sets and Computable Functions |
title_full |
A Note on Recursively Enumerable Sets and Computable Functions |
title_fullStr |
A Note on Recursively Enumerable Sets and Computable Functions |
title_full_unstemmed |
A Note on Recursively Enumerable Sets and Computable Functions |
title_sort |
note on recursively enumerable sets and computable functions |
publishDate |
2009 |
url |
http://ndltd.ncl.edu.tw/handle/96648458207305269166 |
work_keys_str_mv |
AT chaoweichen anoteonrecursivelyenumerablesetsandcomputablefunctions AT chénzhāowěi anoteonrecursivelyenumerablesetsandcomputablefunctions AT chaoweichen dìhuíkěshùjíyǔkějìsuànhánshùzhīgàilùn AT chénzhāowěi dìhuíkěshùjíyǔkějìsuànhánshùzhīgàilùn AT chaoweichen noteonrecursivelyenumerablesetsandcomputablefunctions AT chénzhāowěi noteonrecursivelyenumerablesetsandcomputablefunctions |
_version_ |
1718257936188309504 |