GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
29 views
Turing machine halts exactly  n steps would it  be decidable or undecidable  (re or non re) ?
asked in Theory of Computation by Loyal (3.2k points) 2 11 28
edited by | 29 views
i am asking for exactly n steps not atmost
Ok.But initial question was asking  "Exactly with in n steps" .let me think this
yes i have edited the question now okkk

Please log in or register to answer this question.



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
Top Users Oct 2017
  1. Arjun

    23398 Points

  2. Bikram

    17078 Points

  3. Habibkhan

    8264 Points

  4. srestha

    6296 Points

  5. Debashish Deka

    5438 Points

  6. jothee

    4978 Points

  7. Sachin Mittal 1

    4772 Points

  8. joshi_nitish

    4348 Points

  9. sushmita

    3966 Points

  10. Rishi yadav

    3804 Points


Recent Badges

Famous Question im.raj
Verified Human gk
Notable Question Sanjay Sharma
Popular Question Pravin Paikrao
Notable Question Sanjay Sharma
Notable Question Vineeta
Popular Question rahul sharma 5
Famous Question rahuldb
Great Question jothee
Notable Question Vaishali Trivedi
27,324 questions
35,176 answers
84,111 comments
33,280 users