🚀 go-pugleaf

In article <1992Dec13.162048.14632@miavx1.acs.muohio.edu> khmak@miavx1.acs.muohio.edu writes:
>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


and here is the previous post that is referred to.


>>Article: 3636 of comp.theory
>>Newsgroups: comp.theory
>>Subject: quit
>>Message-ID: <1992Dec11.113208.14609@miavx1.acs.muohio.edu>
>>From: jmcrider@miavx1.acs.muohio.edu
>>Date: 11 Dec 92 11:32:08 -0500
>>Followup-To: comp.theory
>>Distribution: world
>>Organization: Miami University Academic Computer Service"
>>Summary: sorry about the subject
>>Lines: 14

>>I have a few questions that you wizards should be able to answer easily.


>>Why is a two stack PDA equivalent to a Turing machine?

>>Why is it important to know that there is at least one problem that is
>>undecidable?

>>Who cares if P=NP?  What is the significance?


>>Thanks alot

>>JMcrider

Why do I get the feeling that someone is trying to get
solutions to his/her home work problems ? Please note
that both the messages have originated from the same
site.

R. Sritharan