Register
Dark Mode

NIELIT Qtn

in Theory of Computation
263 views
0 votes
0 votes
Consider the following possible outcomes of executing a Turing machine over a given input. Which of the following outcome is NOT possible?
A)TM halts and accepts the input

B)TM halts and rejects the input

C)TM hangs and accepts the input

D)TM never halts.
in Theory of Computation
by
263 views

2 Comments

by
C.
0
0
by
can you explain why?
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!