answersLogoWhite

0


Best Answer

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.

User Avatar

Wiki User

15y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Q.If a language is decidable and Turing recognizable then prove that it is also co Turing?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What does it mean for a computer to be general-purposeHow do we know or prove if a computer is capable of doing anything or to simulate all other (turing) machines?

To be available to everyon


What is meaning Burhan in Arabian language?

Prove .


BLank Is language used to persuade or influence beliefs or attitudes rather than to prove a claim logically?

is language used to persuade or influence beliefs or attitudes, rather than to prove a claim logically


What are some evidences that man has always had language?

The biggest piece of evidence there is to prove that man has always had some type of language is the ancient hieroglyphics. These prove that people found ways to communicate with each other.


What does main support mean in language arts?

I'n pretty sure it means to prove your point and then elaborate on it. Your Welcome:)


Who proved that a machine was capable of processing a stream of 1s and 0s was capable of solving any problem?

Alan Turing devised the Turing Machine which can be described as a robot which can look at one cell on an infinitely long tape of cells and then, based on what is in that cell and a given program either change the symbol in the cell and/or move the robot to look at the cell to the left/right of the current cell. Alan Turing then went on to prove that it was possible to write a program for this machine that could do the same as the program written for any other computing machine (it might take a very, very, very long time to do it but it would do it). However, some programs are impossible to write; for example it is impossible to write a program which will tell you if a program given to it as input will terminate or not (which Alan Turing proved); this is known as the halting problem.


What year did Alan Turing prove that a machine capable of processing a stream of 1s and 0s would be capable of solving any problem?

1942


What is a fodsaw?

There is no such thing in the English language known as a fodsaw. To prove my point further I just typed it in and word has marked it as a spelling error.


Is English difficult language?

English is relatively a very difficult language. It has so many rules and all of them have exceptions. Unlike Spanish it isn't a phonetic language, meaning all of it's word aren't spelled how they sound. It is hard to full master the language, but it is a major language of the world and will prove to be helpful throughout one's life.


How do you say never let you go in Thailand?

to say "never let you go" in any language you prove it by being loyal, faithful and loving.


How do you prove that your boyfriend loves you?

you just gotta trust him. if he loves you theres no need for you to prove it because hes going to have to prove it to you since its his feelings. and love is love either way if youre the one trying to prove he loves you then its a sign of trust issues between the two of you. love has to have trust between the both of you for it to be able to work out. hes the only one that will have to prove it because it is his feelings. you know the loves still there if your gut tells you its there. also his body language will tell you as well. you just gotta trust your instinct.


What can I do with an English as second language certification, and where can I get this qualification?

A second language certification can be very useful with employment and purchasing requirements. This type of certification could also prove useful on a private level when traveling or helping someone who is in need. You can obtain this sort of qualification by completing a technical language course at participating schools or universities.