1. Constructing a turing machine from a PDA - dealing with non-determinism

  2. type 0 grammar to simulate turing machine
  3. Computational Complexity and P vs. NP, A New Insight

  4. i need to know the flowchart for the following turing mechine problem

  5. Simulating Turing Machine with writing only on non-input fields on read-only Turing machine

  6. Is the language below not decidable , if yes , it is then R.E ?
  7. Does closure under union and concatenation imply closure under Kleene star?
  8. Limited oracle TM
  9. Comparing non-deterministic and also the deterministic expressive power of FA, PDA's and TM'S

  10. Church-Turing Thesis and computational power of neural networks

  11. Computational Irreducibility

  12. Are all context-sensitive languages decidable?

  13. How can the set of deciders not recursively enumerable when the set of all Turing Machines is recursively enumerable?
  14. How to compute the language {ww | w ∈ {0,1}*} within a Multitape Turing Machine?
  15. Proof of equivalence of L0 and language accepted by made up machine

  16. Prove that an infinite set is semidecidible

  17. Unary Turing-unrecognizable language
  18. Algorithm to determine if a number is perfect on a Turing Machine
  19. Is {< M >| L(M) ∩ (ab)∗ is infinite} in D, SD/D, or not in SD?
  20. Is it possible to have a code which cannot be solved by computer
  21. Difference between Non R.E and Co-R.E

  22. Self-Referential Proof

  23. The bounded halting problem is decidable. Why doesn't this conflict with Rice's theorem?

  24. decidability about intersection of regular language and context free language

  25. Writing a Turing Machine that convers a number from binary to decimal

  26. decidability about NFA accepting an input
  27. Robustness of Turing Machines - 3 dimensional case
  28. Can two deterministic turing-machines avoid each other in a sidewalk?

  29. Turing Machine - Tape Question
  30. Proving a language is undecidable where a Turing Machine never enters its initial state again
  31. Concatenation of two Turing machines

  32. Is it possible to test if two Turing machines have a common word that both accept?
  33. An infinite decidable language that is a subset of $\overline { A_{TM}}$
  34. Using reduction to prove that a given language is not recursively enumerable
  35. Decidability of a given language

  36. Combining two Turing machines
  37. Computability of a function and decidability
  38. Turing degree incomparable with any countable-ordinal jump of another Turing degree?

  39. Language Accepted by a Turing Machine with a Useless State?

  40. How to show that any computable function is bounded above by Busy Beaver Function?

  41. Show that 0^n1^n is decidable
  42. How does it demonstrate that the computational model of rewriting is adequate?
  43. Unrecognizability of HALT

  44. What is decider?
  45. Proving that the set of deciders is not Turing-recognizable

  46. Decidability of the TM's computing a non-empty subset of total functions
  47. Showing a problem is decidable

  48. Proving there exists an infinite number of Turing machines is a decidable problem

  49. Construct a TM for $L = \{ M | M$ is a Turing machine with no useless states}

  50. Show $USELESS_{TM}=\{ M | M$ is a Turing machine with at least one useless state$\}$ is recursively enumerable?
  51. Use Rice's theorm to prove undecidability of $EPSILON_{TM}$

  52. What is the relationship between two definitions of Turing-computability of a partial function?
  53. What is the explicit definition about the computablity of non-deterministic Turing machine?

  54. Given a computable function $f$ and a decidable language $L$, is there a Turing machine $M$ such that $M$ both decides $L$ and computes $f$?
  55. If $L$ is recursive then so is $L^*$, and vice versa

  56. Given a Turing Machine M, are there infinitely many Turing machines that recognize L(M)?

  57. How can I find the center character of a two-tape Turing Machine in n transitions?

  58. Is the Language below decidable?

  59. ${L^*}$ the Kleene star language is decidable then is $ {L}$ decidable
  60. Are empty-set languages recursively enumerable?

  61. Is the set of languages recognized by a Turing machine with an oracle countable?

  62. Decidability of CFG that accepts at least one odd length string

  63. Proving that it is undecidable if a Turing machine accepts a language that is its own reverse

  64. Is there an equivalence between "does this program halt" and "is this sentence provable"?
  65. The 'directionality' of reductions?
  66. Size of the language accepted by a Turing Machine

  67. Completeness problem of TM
  68. Is below language recursive?
  69. Is $E_{LBA}$ turing-recognizable?
  70. Is it possible to simulate a CPU with software?

  71. What are the examples of trivial and non-trivial properties of language recognized by a Turing machine?
  72. "Any problem whose domain is finite is always Decidable", is true or false?
  73. Turing machine accepts two different strings

  74. Proving Blank-halt to be recursively enumerable through reduction to Halting problem
  75. Is the complement of the Turing machine equality language not recursively enumerable as well?

  76. Turing machine - infinite tape in one or two directions
  77. Non-deterministic limited Turing Machine that recognize the language $P$ of palindromes

  78. Decidability of {(M,w); M terminates on input w and tape of M is empty after computation}
  79. Can input to a Turing machine be of infinite length?

  80. How to prove that $n^k$ is fully space constructable
  81. Undecidability: writing a symbol on Turing Machine's tape

  82. How to determine the DSPACE class for a given Turing Machine?

  83. Does a Turing Machine with a 2-dimensional tape recognize RE languages?
  84. Prove that { ⟨M⟩ ∣ ⟨M⟩ ∉ L(M) } is undecidable
  85. Behavior of non-deterministic Turing Machines after $t_i$ seconds
  86. Prove whether this language is (partially) decidable

  87. A question on oracle turing machines
  88. Non-deterministic Turing Machine recognizing a context-free Language

  89. Non-deterministic 2-tape Turing Machine that recognizes palindromes in linear time
  90. How many tapes would Turing Machine require to find the sum of 2 integers (expressed in base2)?
  91. Reduce Turing Machine
  92. A two-tape deterministic Turing machine that recognizes an exponential string

  93. Deciding on decidability of a problem and reducing it to halting problem if not decidable
  94. Does rice theorem applies to languages only or does it apply to machines as well?
  95. Constructing a decider for a language

  96. $m/p$-equivalence holds after union with an arbitrary finite language
  97. What is the relationship between oracle Turing machine $M^O$ and Turing machine $M$ (given $O$)?

  98. space heirarchy and diagonalization

  99. Deterministic finite automata that accepts the only the string "aabb"

  100. Showing that the language $L = \{\langle M, w \rangle\ |\ M$ moves left at least three times while computing $w \}$ is decidable or undecidable