Re: PSPACE closed under union
- From: Chris Smith <cdsmith@xxxxxxx>
- Date: Fri, 13 Apr 2007 09:07:54 -0600
hbdere <hbdere@xxxxxxx> wrote:
On Apr 12, 4:43 pm, "cooldavid" <vmvicto...@xxxxxxxxx> wrote:
So yeah, the answer should be short.Ok, the single word is "dovetailing":
http://en.wikipedia.org/wiki/Dovetailing_%28computer_science%29
Since the languages are in PSPACE, there exists a polynomial space
decider for them; not a polynomial space recognizer. So dovetailing
should not be necessary, because the first machine is guaranteed to
terminate anyway.
--
Chris Smith
.
- References:
- PSPACE closed under union
- From: cooldavid
- Re: PSPACE closed under union
- From: hbdere
- Re: PSPACE closed under union
- From: cooldavid
- Re: PSPACE closed under union
- From: hbdere
- PSPACE closed under union
- Prev by Date: Re: P vs NP
- Next by Date: Two-step Non-deterministic Process for Solving NP Problems
- Previous by thread: Re: PSPACE closed under union
- Next by thread: P vs NP
- Index(es):