Hi, Thanks for replying. I am aware of that. But is there a practical way of checking it????
On Mar 26, 7:40 pm, Carl Barton <odysseus.ulys...@gmail.com> wrote: > If it can simulate a universal turing machine then it is turing complete > > On 26 March 2011 22:34, Karthik Jayaprakash > <howtechstuffwo...@gmail.com>wrote: > > > > > > > > > Hi, > > Is there a way to check that if a language is Turing complete????? > > > Thanks. > > > -- > > 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 > > algogeeks+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
