computation theory - A language that is RE complete with respect to polynomial-time reductions? -
is there language in re complete regard polynomial-time reductions?
i think a_tm example,but i'm not sure...
yes, atm re-complete respect polynomial-time reductions. given re language l, let m recognizer it. function f(w) = can computed in polynomial time (for reasonable representation of tuples) because m fixed machine , length of w in encoded version should @ polynomially larger original input w. have w ∈ l if , if m accepts w if , if ∈ atm, f polynomial-time reduction arbitrary re language l atm, making atm re-complete respect polynomial-time reductions.
i'm not sure why you'd interested in particular notion of re-completeness, since re useful notions of computability (can solve problem @ all?) while polynomial-time reductions complexity (can solve problem efficiently?) if have interesting use case them, though, i'd love hear it!
Comments
Post a Comment