To elaborate why; if your language suffers from the halting problem then it's pretty safe to say it's turing complete and infinite loops would allow you to achieve that.
On 27 March 2011 19:03, Carl Barton <[email protected]> wrote: > If you're not concerned about being that formal then having conditional > branching statements and being able to write infinite loops would be a > pretty good indication. > > > On 27 March 2011 14:38, Karthik Jayaprakash > <[email protected]>wrote: > >> 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 <[email protected]> wrote: >> > If it can simulate a universal turing machine then it is turing complete >> > >> > On 26 March 2011 22:34, Karthik Jayaprakash < >> [email protected]>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 [email protected]. >> > > To unsubscribe from this group, send email to >> > > [email protected]. >> > > 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
