Find a new automata ,it's language is only recursive language.
This automata is non-turing's computation, manybe, it don't has
halting problem.
I would like to know what do you think of this idea. I know this
is a crazy idea, but this idea may be right.
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
