• 沒有找到結果。

Theory of Computation

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "Theory of Computation"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

Theory of Computation

Homework 1 Due: 2012/10/02

Problem 1 Read Examples 2.1, 2.2, and 2.3 in the textbook. No answers required.

Problem 2 Recall that if L is decided by some Turing machine, then L is called recursive. Show that any finite set S of natural numbers is recursive.

Ans:

Let L = {n0, n1, . . . , nk}. We can write an algorithm to decide L. To check whether the input number x is in L, check: Is x = n0? Is x = n1? . . . Is x = nk? Note that n0, . . . , nk are part of the program, not inputs. If one of the checks is true, answer “yes”; otherwise, answer “no”.

參考文獻

立即下載 ( PDF - 1 頁 - 69.07 KB )

相關文件

Note 1.1 Limit: Definitions and Basic Concepts

But, some observations tell us that there seem to be something out there that we will obtain if we really repeat procedures infinitely many times.. That something is called

Chapter 4: Decidability I

i.e., accept/reject in a finite number of steps We will show some examples.. Then we can convert the NFA to a DFA The key is that the conversion is a

Hard-Margin SVM and Large Margin

(Lecture 203) In this problem, we are going to apply the kernel trick to the perceptron learning algorithm introduced in Machine Learning Foundations. We can then maintain the

Assignment 9 solution & commentary

To show that NP is closed under the star operation, given a non-deterministic Turing machine A for a language L, we shall construct a Turing machine A* that accepts L*. The

From calculus, we know the arc length of C is given by the formula L(C

[r]

By defini- tion, one can check that f is an identification map

Topology Topology Take Home Final Exam (Continued) Fall Semester 2016 3... Topology Topology Take Home Final Exam (Continued) Fall Semester

Show that if µ is semifinite and µ(E

(3%) (c) Given an example shows that (a) may be false if E has a zero divisors. Find the invariant factors of A and φ and their minimal polynomial. Apply

Recall that a function F : C/L → C can regarded as a function f : C → C such that f (z + l

Department of Mathematics, National Taiwan University, Taipei, Taiwan E-mail