GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
27 views
Turing machine halts exactly  n steps would it  be decidable or undecidable  (re or non re) ?
asked in Theory of Computation by Active (1.6k points)  
edited by | 27 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.

Related questions

+1 vote
1 answer
1
asked in Theory of Computation by Vivek Jain Junior (653 points)   | 28 views
+1 vote
0 answers
2
asked in Theory of Computation by Kaluti Active (1.6k points)   | 17 views


Top Users Aug 2017
  1. ABKUNDAN

    4670 Points

  2. Bikram

    4556 Points

  3. akash.dinkar12

    3420 Points

  4. rahul sharma 5

    3118 Points

  5. manu00x

    2864 Points

  6. makhdoom ghaya

    2450 Points

  7. just_bhavana

    2136 Points

  8. Tesla!

    2042 Points

  9. stblue

    1930 Points

  10. joshi_nitish

    1686 Points


24,969 questions
32,072 answers
74,565 comments
30,147 users