Article View: comp.theory
Article #17092 stack PDA and other questions
From: khmak
Date: Sun, 13 Dec 1992 21:20
Date: Sun, 13 Dec 1992 21:20
18 lines
839 bytes
839 bytes
A few days ago someone posted a few questions that I was also curious about
knowing the answer to. Here they are:
Why is a 2 stack PDA equivalent to a turing machine?
Why is it important to know if there is at least one decision problem that is
undecidable?
Who cares if P=NP? Or what is the significance of the question "Is P=NP"?
Here is one of mine:
Why is L={www|wE{a,b}+} not contect free?
Thank you for the information.
Karl
Technical Details
Message-ID:
<1992Dec13.162048.14632@miavx1.acs.muohio.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!wupost!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!ohstpy!miavx1!khmakShow Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!wupost!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!ohstpy!miavx1!khmak Newsgroups: comp.theory Subject: 2 stack PDA and other questions Message-ID: <1992Dec13.162048.14632@miavx1.acs.muohio.edu> From: khmak@miavx1.acs.muohio.edu Date: 13 Dec 92 16:20:48 -0500 Organization: Miami University Academic Computer Service" Lines: 18