Re: Find a new automata ,it's language is only Recursive Lanauge.

Dnia 30-10-2008 o 23:18:06 Joe Schafer <joe@xxxxxxxxxxxxxx> napisał(a):

So do you know of an effective test for recursiveness???? One that
always halts!!!

What?...

I would sure be interested in how you intend to guarantee that
mutually recursive constructs in the grammer don't create infinite
loops. They appear to me to be just the same as the mutually
recursive constructs in a recursively enumerable language that create
the halting problem.

What?... I'm not kidding. I don't follow your logic. I said that your sentence:

,,If you COULD build an automata that ONLY matched recursive languages, this would imply you have a solution to the halting problem.''

is wrong, and explained why it is wrong. Your imagination is really impressive.

In any case, if you saying that we define an "only recursive
automata" by simply taking a TM and only loading it with known
recursive languages, what's the point???

What? Do you know the definition of a Turing machine?

We know those calculations
are always total and it doesn't add anything to what we already know
about TM's. I can load a regular language into a PDA and it works
just fine. But that doesn't tell me anything new about regular
languages or PDA's.

Modulo the strange term ,,load'' - sure, that's what I tried to say.


--
Michał Przybyłek
.

Relevant Pages

  • Re: metrics on context-free languages
    ... Any regular language can be characterized by the set of n-glyphs (for n ... The same is true for context-free languages -- except the sequence is ... In SCHEME #2, you allow introduction of a star on the right side. ... needs a notion of a sufficient condition on the occurences of star. ...
    (sci.math.research)
  • Re: metrics on context-free languages
    ... Any regular language can be characterized by the set of n-glyphs (for n ... The same is true for context-free languages -- except the sequence is ... In SCHEME #2, you allow introduction of a star on the right side. ... needs a notion of a sufficient condition on the occurences of star. ...
    (comp.theory)