• 沒有找到結果。

# Functional Completeness

N/A
N/A
Protected

Share "Functional Completeness"

Copied!
66
0
0

(1)

### Functional Completeness

• A set of logical connectives is called functionally

complete if every boolean expression is equivalent to one involving only these connectives.

• The set { ¬, ∨, ∧ } is functionally complete.

– Every boolean expression can be turned into a CNF, which involves only ¬, ∨, and ∧.

• The sets { ¬, ∨ } and { ¬, ∧ } are functionally complete.

– By the above result and de Morgan’s laws.

• { nand } and { nor } are functionally complete.a

(2)

### Satisfiability

• A boolean expression φ is satisfiable if there is a truth assignment T appropriate to it such that T |= φ.

• φ is valid or a tautology,a written |= φ, if T |= φ for all T appropriate to φ.

aWittgenstein (1922). Wittgenstein is one of the most important philosophers of all time. Russell (1919), “The importance of ‘tautology’

for a deﬁnition of mathematics was pointed out to me by my former pupil Ludwig Wittgenstein, who was working on the problem. I do not know whether he has solved it, or even whether he is alive or dead.”

“God has arrived,” the great economist Keynes (1883–1946) said of him on January 18, 1928, “I met him on the 5:15 train.”

(3)

### Satisfiability (concluded)

• φ is unsatisfiable or a contradiction if φ is false under all appropriate truth assignments.

– Or, equivalently, if ¬φ is valid (prove it).

• φ is a contingency if φ is neither a tautology nor a contradiction.

(4)

### Ludwig Wittgenstein (1889–1951)

Wittgenstein (1922),

“Whereof one cannot speak, thereof one must be silent.”

(5)

### satisfiability (sat)

• The length of a boolean expression is the length of the string encoding it.

• satisfiability (sat): Given a CNF φ, is it satisﬁable?

• Solvable in exponential time on a TM by the truth table method.

• Solvable in polynomial time on an NTM, hence in NP (p. 114).

• A most important problem in settling the “P = NP”? problem (p. 299).

(6)

### unsatisfiability (unsat or sat complement) and validity

• unsat (sat complement): Given a boolean expression φ, is it unsatisﬁable?

• validity: Given a boolean expression φ, is it valid?

φ is valid if and only if ¬φ is unsatisﬁable.

φ and ¬φ are basically of the same length.

– So unsat and validity have the same complexity.

• Both are solvable in exponential time on a TM by the truth table method.

(7)

### Relations among sat, unsat, and validity

Contingent

Valid Unsatisfiable

• The negation of an unsatisﬁable expression is a valid expression.

• None of the three problems—satisﬁability,

unsatisﬁability, validity—are known to be in P.

(8)

### Boolean Functions

• An n-ary boolean function is a function

f : { true, false }n → { true, false }.

• It can be represented by a truth table.

• There are 22n such boolean functions.

– We can assign true or false to f for each of the 2n truth assignments.

(9)

### Boolean Functions (continued)

Assignment Truth value 1 true or false 2 true or false

... ...

2n true or false

(10)

### Boolean Functions (continued)

• A boolean expression expresses a boolean function.

– Think of its truth value under all truth assignments.

• A boolean function expresses a boolean expression.



T |= φ, literal yi is true in “row” T (y1 ∧ · · · ∧ yn).

∗ y1 ∧ · · · ∧ yn is called the minterm over { x1, . . . , xn } for T .a

– The sizeb is ≤ n2n ≤ 22n.

aSimilar to programmable logic array.

bWe count only the literals here.

(11)

### Boolean Functions (continued)

x1 x2 f(x1, x2)

0 0 1

0 1 1

1 0 0

1 1 1

The corresponding boolean expression:

(¬x1 ∧ ¬x2) ∨ (¬x1 ∧ x2) ∨ (x1 ∧ x2).

(12)

### Boolean Functions (concluded)

Corollary 13 Every n-ary boolean function can be expressed by a boolean expression of size O(n2n).

• In general, the exponential length in n cannot be avoided (p. 195).

• The size of the truth table is also O(n2n).

(13)

### Boolean Circuits

• A boolean circuit is a graph C whose nodes are the gates.

• There are no cycles in C.

• All nodes have indegree (number of incoming edges) equal to 0, 1, or 2.

• Each gate has a sort from

{ true, false, ∨, ∧, ¬, x1, x2, . . . }.

– There are n + 5 sorts.

(14)

### Boolean Circuits (concluded)

• Gates with a sort from { true, false, x1, x2, . . . } are the inputs of C and have an indegree of zero.

• The output gate(s) has no outgoing edges.

• A boolean circuit computes a boolean function.

• A boolean function can be realized by inﬁnitely many equivalent boolean circuits.

(15)

### Boolean Circuits and Expressions

• They are equivalent representations.

• One can construct one from the other:

¬ [L ¬

[L

[L ∨ [M

[L [M

[L ∧ [M

[L [M

(16)

### An Example

((x1 x2 ) (x3 x4)) (x3 x4))

x1 x2 x3 x4

• Circuits are more economical because of the possibility of “sharing.”

(17)

### circuit sat and circuit value

circuit sat: Given a circuit, is there a truth assignment such that the circuit outputs true?

• circuit sat ∈ NP: Guess a truth assignment and then evaluate the circuit.

circuit value: The same as circuit sat except that the circuit has no variable gates.

• circuit value ∈ P: Evaluate the circuit from the input gates gradually towards the output gate.

(18)

### Some Boolean Functions Need Exponential Circuits

a

Theorem 14 (Shannon (1949)) For any n ≥ 2, there is an n-ary boolean function f such that no boolean circuits with 2n/(2n) or fewer gates can compute it.

• There are 22n diﬀerent n-ary boolean functions (p. 185).

• So it suﬃces to prove that the number of boolean circuits with 2n/(2n) or fewer gates is less than 22n.

aCan be strengthened to “almost all boolean functions . . .”

(19)

### The Proof (concluded)

• There are at most ((n + 5) × m2)m boolean circuits with m or fewer gates (see next page).

• But ((n + 5) × m2)m < 22n when m = 2n/(2n):

m log2((n + 5) × m2)

= 2n



1 log2 n+54n2 2n



< 2n for n ≥ 2.

(20)

(21)

### Claude Elwood Shannon (1916–2001)

Howard Gardner, “[Shannon’s mas- ter’s thesis is] possibly the most im- portant, and also the most famous, master’s thesis of the century.”

(22)

• The lower bound 2n/(2n) is rather tight because an upper bound is n2n (p. 187).

• The proof counted the number of circuits.

– Some circuits may not be valid at all.

– Diﬀerent circuits may also compute the same function.

• Both are ﬁne because we only need an upper bound on the number of circuits.

• We do not need to consider the outgoing edges because they have been counted as incoming edges.a

aIf you prove it by considering outgoing edges, the bound will not be

(23)

## Relations between Complexity Classes

(24)

It is, I own, not uncommon to be wrong in theory and right in practice.

— Edmund Burke (1729–1797), A Philosophical Enquiry into the Origin of Our Ideas of the Sublime and Beautiful (1757)

(25)

### Proper (Complexity) Functions

• We say that f : N → N is a proper (complexity) function if the following hold:

f is nondecreasing.

– There is a k-string TM Mf such that Mf(x) = f(| x |) for any x.a

Mf halts after O(| x | + f(| x |)) steps.

Mf uses O(f (| x |)) space besides its input x.

• Mf’s behavior depends only on | x | not x’s contents.

• Mf’s running time is bounded by f (n).

a ” the quasi-blank symbol. The use of M

(26)

### Examples of Proper Functions

• Most “reasonable” functions are proper: c, log n , polynomials of n, 2n, √n , n!, etc.

• If f and g are proper, then so are f + g, fg, and 2g.a

• Nonproper functions when serving as the time bounds for complexity classes spoil “theory building.”

– For example, TIME(f (n)) = TIME(2f(n)) for some recursive function f (the gap theorem).b

• Only proper functions f will be used in TIME(f(n)), SPACE(f (n)), NTIME(f (n)), and NSPACE(f (n)).

aFor f (g), we need to add f (n) ≥ n.

b

(27)

### Precise Turing Machines

• A TM M is precise if there are functions f and g such that for every n ∈ N, for every x of length n, and for every computation path of M ,

M halts after precisely f(n) steps, and

– All of its strings are of length precisely g(n) at halting.

∗ Recall that if M is a TM with input and output, we exclude the ﬁrst and last strings.

• M can be deterministic or nondeterministic.

(28)

### Precise TMs Are General

Proposition 15 Suppose a TMa M decides L within time (space) f (n), where f is proper. Then there is a precise TM M which decides L in time O(n + f (n)) (space O(f (n)), respectively).

• M on input x ﬁrst simulates the TM Mf associated with the proper function f on x.

• Mf’s output, of length f (| x |), will serve as a

“yardstick” or an “alarm clock.”

aIt can be deterministic or nondeterministic.

(29)

### The Proof (continued)

• Then M simulates M (x).

• M(x) halts when and only when the alarm clock runs out—even if M halts earlier.

• If f is a time bound:

– The simulation of each step of M on x is matched by advancing the cursor on the “clock” string.

– Because M stops at the moment the “clock” string is exhausted—even if M (x) stops earlier, it is precise.

– The time bound is therefore O(| x | + f(| x |)).

(30)

### The Proof (concluded)

• If f is a space bound (sketch):

M simulates M on the quasi-blanks of Mf’s output string.

– The total space, not counting the input string, is O(f(n)).

– But we still need a way to make sure there is no inﬁnite loop.a

aSee the proof of Theorem 22 on p. 223.

(31)

### Important Complexity Classes

• We write expressions like nk to denote the union of all complexity classes, one for each value of k.

• For example,

NTIME(nk) = 

j>0

NTIME(nj).

(32)

### Important Complexity Classes (concluded)

P = TIME(nk), NP = NTIME(nk), PSPACE = SPACE(nk), NPSPACE = NSPACE(nk),

E = TIME(2kn), EXP = TIME(2nk),

L = SPACE(log n), NL = NSPACE(log n).

(33)

### Complements of Nondeterministic Classes

• Recall that the complement of L, or ¯L, is the language Σ − L.

– sat complement is the set of unsatisﬁable boolean expressions.

• R, RE, and coRE are distinct (p. 152).

– Again, coRE contains the complements of languages in RE, not languages that are not in RE.

• How about coC when C is a complexity class?

(34)

### The Co-Classes

• For any complexity class C, coC denotes the class { L : ¯L ∈ C }.

• Clearly, if C is a deterministic time or space complexity class, then C = coC.

– They are said to be closed under complement.

– A deterministic TM deciding L can be converted to one that decides ¯L within the same time or space bound by reversing the “yes” and “no” states

(p. 149).

• Whether nondeterministic classes for time are closed

(35)

• As

coC = { L : ¯L ∈ C }, L ∈ C if and only if ¯L ∈ coC.

• But it is not true that L ∈ C if and only if L ∈ coC.

– coC is not deﬁned as ¯C.

• For example, suppose C = {{ 2, 4, 6, 8, 10, . . . }}.

• Then coC = {{ 1, 3, 5, 7, 9, . . . }}.

• But ¯C = 2{ 1,2,3,... } − {{ 2, 4, 6, 8, 10, . . . }}.

(36)

### The Quantified Halting Problem

• Let f(n) ≥ n be proper.

• Deﬁne

Hf = { M; x : M accepts input x after at most f (| x |) steps }, where M is deterministic.

• Assume the input is binary.

(37)

f

3

### )

• For each input M; x, we simulate M on x with an alarm clock of length f (| x |).

– Use the single-string simulator (p. 80), the universal TM (p. 130), and the linear speedup theorem (p. 90).

– Our simulator accepts M ; x if and only if M accepts x before the alarm clock runs out.

• From p. 87, the total running time is O(MkM2 f(n)2), where M is the length to encode each symbol or state of M and kM is M ’s number of strings.

• As MkM2 = O(n), the running time is O(f (n)3), where

(38)

f

### ∈ TIME(f(n/2))

• Suppose TM MHf decides Hf in time f (n/2).

• Consider machine:

Df(M ) {

if MHf(M ; M ) = “yes”

then “no”;

else “yes”;

}

• Df on input M runs in the same time as MHf on input M; M, i.e., in time f(2n+12 ) = f(n), where n = | M |.a

aA student pointed out on October 6, 2004, that this estimation for-

(39)

### The Proof (concluded)

• First,

Df(Df) = “yes”

⇒ Df; Df ∈ Hf

⇒ Df does not accept Df within time f (| Df |)

⇒ Df(Df) = “yes”

• Similarly, Df(Df) = “no” ⇒ Df(Df) = “yes.”

(40)

### The Time Hierarchy Theorem

Theorem 16 If f (n) ≥ n is proper, then

TIME(f (n))  TIME(f(2n + 1)3).

• The quantiﬁed halting problem makes it so.

Corollary 17 P  E.

• P ⊆ TIME(2n) because poly(n) ≤ 2n for n large enough.

• But by Theorem 16,

TIME(2n)  TIME((22n+1)3) ⊆ E.

• So P  E.

(41)

### The Space Hierarchy Theorem

Theorem 18 (Hennie and Stearns (1966)) If f (n) is proper, then

SPACE(f (n))  SPACE(f(n) log f(n)).

Corollary 19 L  PSPACE.

(42)

### Nondeterministic Time Hierarchy Theorems

Theorem 20 (Cook (1973)) NTIME(nr)  NTIME(ns) whenever 1 ≤ r < s.

Theorem 21 (Seiferas, Fischer, and Meyer (1978)) If T1(n), T2(n) are proper, then

NTIME(T1(n))  NTIME(T2(n)) whenever T1(n + 1) = o(T2(n)).

(43)

### The Reachability Method

• The computation of a time-bounded TM can be represented by a directed graph.

• The TM’s conﬁgurations constitute the nodes.

• There is a directed edge from node x to node y if x yields y in one step.

• The start node representing the initial conﬁguration has zero in-degree.

(44)

### The Reachability Method (concluded)

• When the TM is nondeterministic, a node may have an out-degree greater than one.

– The graph is the same as the computation tree earlier except that identical conﬁgurations are merged into one node.

• So M accepts the input if and only if there is a path from the start node to a node with a “yes” state.

• It is the reachability problem.

(45)

(46)

### Relations between Complexity Classes

Theorem 22 Suppose f (n) is proper. Then 1. SPACE(f (n)) ⊆ NSPACE(f(n)),

TIME(f (n)) ⊆ NTIME(f(n)).

2. NTIME(f (n)) ⊆ SPACE(f(n)).

3. NSPACE(f (n)) ⊆ TIME(klog n+f(n)).

• Proof of 2:

– Explore the computation tree of the NTM for “yes.”

– Speciﬁcally, generate an f (n)-bit sequence denoting the nondeterministic choices over f (n) steps.

(47)

### Proof of Theorem 22(2)

• (continued)

– Simulate the NTM based on the choices.

– Recycle the space and repeat the above steps.

– Halt with “yes” when a “yes” is encountered or “no”

if the tree is exhausted.

– Each path simulation consumes at most O(f (n)) space because it takes O(f (n)) time.

– The total space is O(f (n)) because space is recycled.

(48)

### Proof of Theorem 22(3)

• Let k-string NTM

M = (K, Σ, Δ, s)

with input and output decide L ∈ NSPACE(f(n)).

• Use the reachability method on the conﬁguration graph of M on input x of length n.

• A conﬁguration is a (2k + 1)-tuple

(q, w1, u1, w2, u2, . . . , wk, uk).

(49)

### Proof of Theorem 22(3) (continued)

(q, i, w2, u2, . . . , wk−1, uk−1),

where i is an integer between 0 and n for the position of the ﬁrst cursor.

• The number of conﬁgurations is therefore at most

| K | × (n + 1) × | Σ |2(k−2)f(n) = O(clog n+f(n)1 ) (1) for some c1, which depends on M .

• Add edges to the conﬁguration graph based on M’s

(50)

### Proof of Theorem 22(3) (concluded)

• x ∈ L ⇔ there is a path in the conﬁguration graph from the initial conﬁguration to a conﬁguration of the form (“yes”, i, . . .).a

• This is reachability on a graph with O(clog n+f(n)1 ) nodes.

• It is in TIME(clog n+f(n)) for some c because reachability ∈ TIME(nj) for some j and

clog n+f(n)1 j

= (cj1)log n+f(n).

aThere may be many of them.

(51)

### Space-Bounded Computation and Proper Functions

• In the deﬁnition of space-bounded computations earlier (p. 105), the TMs are not required to halt at all.

• When the space is bounded by a proper function f, computations can be assumed to halt:

– Run the TM associated with f to produce a quasi-blank output of length f (n) ﬁrst.

– The space-bounded computation must repeat a

conﬁguration if it runs for more than clog n+f(n) steps for some c (p. 226).

(52)

### Space-Bounded Computation and Proper Functions (concluded)

• (continued)

– So an inﬁnite loop occurs during simulation for a computation path longer than clog n+f(n) steps.

– Hence we only simulate up to clog n+f(n) time steps per computation path.

(53)

### A Grand Chain of Inclusions

a

• It is an easy application of Theorem 22 (p. 223) that L ⊆ NL ⊆ P ⊆ NP ⊆ PSPACE ⊆ EXP.

• By Corollary 19 (p. 218), we know L  PSPACE.

• So the chain must break somewhere between L and EXP.

• It is suspected that all four inclusions are proper.

• But there are no proofs yet.

aWith input from Mr. Chin-Luei Chang (R93922004, D95922007) on October 22, 2004.

(54)

### What Is Wrong with the Proof?

a

• By Theorem 22(2) (p. 223), NL ⊆ TIME

kO(log n)

⊆ TIME (nc1) for some c1 > 0.

• By Theorem 16 (p. 217),

TIME (nc1)  TIME (nc2) ⊆ P for some c2 > c1.

• So

NL = P.

aContributed by Mr. Yuan-Fu Shao (R02922083) on November 11,

(55)

### What Is Wrong with the Proof? (concluded)

• Recall from p. 208 that TIME(kO(log n)) is a shorthand

for 

j>0

TIME

jO(log n) .

• So the correct proof runs more like NL 

j>0

TIME

jO(log n)



c>0

TIME (nc) = P.

• And

NL = P

(56)

### Nondeterministic and Deterministic Space

• By Theorem 6 (p. 111),

NTIME(f (n)) ⊆ TIME(cf(n)), an exponential gap.

• There is no proof yet that the exponential gap is inherent.

• How about NSPACE vs. SPACE?

• Surprisingly, the relation is only quadratic—a polynomial—by Savitch’s theorem.

(57)

### Savitch’s Theorem

Theorem 23 (Savitch (1970))

reachability ∈ SPACE(log2 n).

• Let G(V, E) be a graph with n nodes.

• For i ≥ 0, let

PATH(x, y, i)

mean there is a path from node x to node y of length at most 2i.

• There is a path from x to y if and only if PATH(x, y, log n )

(58)

### The Proof (continued)

• For i > 0, PATH(x, y, i) if and only if there exists a z such that PATH(x, z, i − 1) and PATH(z, y, i − 1).

• For PATH(x, y, 0), check the input graph or if x = y.

• Compute PATH(x, y, log n ) with a depth-ﬁrst search on a graph with nodes (x, y, z, i)s (see next page).a

• Like stacks in recursive calls, we keep only the current path of (x, y, i)s.

• The space requirement is proportional to the depth of the tree (log n ) times the size of the items stored at each node.

(59)

### The Proof (continued): Algorithm for PATH (x, y, i)

1: if i = 0 then

2: if x = y or (x, y) ∈ E then

3: return true;

4: else

5: return false;

6: end if

7: else

8: for z = 1, 2, . . . , n do

9: if PATH(x, z, i − 1) and PATH(z, y, i − 1) then

10: return true;

11: end if

12: end for

13: return false;

(60)

### The Proof (continued)

[\ Q

[] Q ]\ Q

ØÙ

ØÙ ØÙ

(61)

### The Proof (concluded)

• Depth is log n , and each node (x, y, z, i) needs space O(log n).

• The total space is O(log2 n).

(62)

### The Relation between Nondeterministic and Deterministic Space Is Only Quadratic

Corollary 24 Let f (n) ≥ log n be proper. Then NSPACE(f (n)) ⊆ SPACE(f2(n)).

• Apply Savitch’s proof to the conﬁguration graph of the NTM on its input.

• From p. 226, the conﬁguration graph has O(cf(n)) nodes; hence each node takes space O(f (n)).

• But if we construct explicitly the whole graph before applying Savitch’s theorem, we get O(cf(n)) space!

(63)

### The Proof (continued)

• The way out is not to generate the graph at all.

• Instead, keep the graph implicit.

• We checked node connectedness only when i = 0 on p. 236, by examining the input graph G.

• Now, given conﬁgurations x and y, we go over the Turing machine’s program to determine if there is an instruction that can turn x into y in one step.a

aThanks to a lively class discussion on October 15, 2003.

(64)

### The Proof (concluded)

• The z variable in the algorithm on p. 236 simply runs through all possible valid conﬁgurations.

– Let z = 0, 1, . . . , O(cf(n)).

– Make sure z is a valid conﬁguration before using it.a

• Each z has length O(f(n)).

• So each node needs space O(f(n)).

• The depth of the recursive call on p. 236 is O(log cf(n)), which is O(f (n)).

• The total space is therefore O(f2(n)).

a

(65)

### Implications of Savitch’s Theorem

• PSPACE = NPSPACE.

• Nondeterminism is less powerful with respect to space.

• Nondeterminism may be very powerful with respect to time as it is not known if P = NP.

(66)

### Nondeterministic Space Is Closed under Complement

• Closure under complement is trivially true for deterministic complexity classes (p. 211).

• It is known thata

coNSPACE(f (n)) = NSPACE(f (n)). (2)

• So

coNL = NL.

• But it is not known whether coNP = NP.

aSzelepsc´enyi (1987); Immerman (1988).

The PROM is a combinational programmable logic device (PLD) – an integrated circuit with programmable gates divided into an AND array and an OR array to provide an

The design of a sequential circuit with flip-flops other than the D type flip-flop is complicated by the fact that the input equations for the circuit must be derived indirectly

Graph Algorithms Euler Circuit Hamilton Circuit.. for Sprout 2014 by Chin

Graph Algorithms Euler Circuit Hamilton Circuit.. for Sprout 2014 by Chin

 There is no Hamilton circuit in G2 (this can be seen by nothing that any circuit containing every vertex must contain the edge {a,b} twice), but G2 does have a Hamilton

 If SAT can be solved in deterministic polynomial time, then so can any NP problems  SAT ∈ NP-hard..  If A is an NP-hard problem and B can be reduced from A, then B is an

• If we know how to generate a solution, we can solve the corresponding decision problem. – If you can find a satisfying truth assignment efficiently, then sat is

– Equivalently, there is a truth assignment such that each clause has a literal assigned true and a literal assigned false.. – Equivalently, there is a satisfying truth assignment