Question About Turing-Recognizable Language

Automata theory, Computability theory, Computational complexity theory, Quantum computing theory. Get some help on My Computer Forum

Moderators: shynthriir, johnny, SidT

Question About Turing-Recognizable Language

Postby dalant019 » Tue Feb 16, 2010 9:09 am

Hi, all.
It's definistion is the same Sipser's.
Is "halting problem" Turing-Recognizable?
Some text says there are many such problems. Could you tell me another?

Thank you for reading.
----------
I didn't knew that this subject is very interesting.
dalant019
 
Posts: 2
Joined: Wed Sep 30, 2009 2:00 am

Return to Theory of Computation

Who is online

Registered users: No registered users