Recent content by crazyautomata

  1. C

    Is L1 intersect L2 decidable for Turing machines?

    I mean partially decidable or recursively enumerable.
  2. C

    Is L1 intersect L2 decidable for Turing machines?

    Homework Statement I have a question regarding undecidable languages. Let L1 = { M | M is an encoding of a Turing machine that accepts any input} and L2 = { M | M is an Turing machine with at most 100 states}. Is L1 intersect L2 decidable? Homework Equations The Attempt at a...
See more