answersLogoWhite

0


Best Answer

Any language L is Turing decidable if there exist a TM M, such that on input string x, where x belong to L, M either accepts it or rejects it........(But never goes into a loop )

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is turing decidable langues?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Q.If a language is decidable and Turing recognizable then prove that it is also co Turing?

Turing Decidable Languages are both Turing Rec and Turing Co-Recognizable. If a Language is Not Turing Decidable, either it, or it's complement, must be not Recognizable.


Define formally Turing-Decidable Problem?

define function formally and using f(x) notation


What are types of turing machine?

multiple trackshift over turing machinenon deterministictwo way turing machinemultitape turing machineoffline turing machinemultidimensional turing machinecomposite turing machineuniversal turing machine


When was L'Imparfait des Langues created?

L'Imparfait des Langues was created in 2005-04.


What do you call all languages in french?

"Languages" in French is "Langues". "All languages" is "Toutes les langues".


How do you say 'What languages do you speak' in French?

Tu parles quelles langues?


When was École des Jeunes de langues created?

École des Jeunes de langues was created in 1669.


Y a-t-il combien de langues?

Il existe environ 7 000 langues parlées dans le monde.


How do you spell langues meaning languages?

That is the French spelling (langues) of the plural noun meaning languages.


Who made turing?

Kishan, the King is the creator the Turing.


Did Alan turing invent the turing machean?

Yes, he did.


What is Alan Turing's gender?

Alan Turing was a male.