Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Complement of Halting problem
Na462
asked
in
Theory of Computation
Jan 21, 2018
1,413
views
2
votes
2
votes
I totally understand the Halting problem, what about complement of halting problem? Is this the set of all those language which never halts? Why complement of halting problem is not re? Proof plz
theory-of-computation
turing-machine
Na462
asked
in
Theory of Computation
Jan 21, 2018
by
Na462
1.4k
views
answer
comment
Follow
share this
share
1 comment
by
nadeshseen
commented
Nov 9, 2019
reply
Follow
share this
halting problem is recursively enumerable, therefore its complement will be NOT RE.
NOT RE = Languages in which TM will never halt on atleast one string that is in the language.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
3
answers
1
gmrishikumar
asked
in
Theory of Computation
Dec 10, 2018
1,713
views
Halting problem of TM which recognize recursive languages is undecidable?
Halting problem of Turing machines which recognize recursive languages is undecidable. (True / False)
gmrishikumar
asked
in
Theory of Computation
Dec 10, 2018
by
gmrishikumar
1.7k
views
decidability
recursive-and-recursively-enumerable-languages
theory-of-computation
turing-machine
rice-theorem
5
votes
5
votes
2
answers
2
Kapil
asked
in
Theory of Computation
Sep 27, 2016
2,072
views
Halting Problem of Turing Machines
Can anyone provide the proof of halting problem of turing machines by contradiction ? If possible, give example, how is it reduced to other turing problems ?
Kapil
asked
in
Theory of Computation
Sep 27, 2016
by
Kapil
2.1k
views
theory-of-computation
turing-machine
decidability
2
votes
2
votes
1
answer
3
monty
asked
in
Theory of Computation
Oct 26, 2016
784
views
Halting Problem
monty
asked
in
Theory of Computation
Oct 26, 2016
by
monty
784
views
theory-of-computation
turing-machine
decidability
0
votes
0
votes
3
answers
4
Parimal Paritosh
asked
in
Digital Logic
Sep 20, 2017
3,824
views
2's complement addition of two negative numbers
Please give me an example of adding two negative numbers using 2's complement number system. Let's say: -7 + (-6)
Parimal Paritosh
asked
in
Digital Logic
Sep 20, 2017
by
Parimal Paritosh
3.8k
views
digital-logic
turing-machine
theory-of-computation
number
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
