# Can one write useful programs in Turing machine language? [closed]

In other words, could one theoretically design a turing machine that does everything the shell program sed does?

-
This site is for research-level theoretical computer science questions (The faq: cstheory.stackexchange.com/faq). You may ask in math.stackexchange.com/ instead. – M. Alaggan Jun 9 '11 at 1:33
This question is not research level. (However, the answer it yes because it is Turing complete. – Tyson Williams Jun 9 '11 at 3:27
Well, Turing machines are Turing complete. However, Turing machines typically don't have much in the way of hardware --- I've never seen one with a screen and keyboard --- so I doubt a Turing sed machine would be of much use. youtube.com/watch?v=cYw2ewoO6c4 – François G. Dorais Jun 9 '11 at 3:28

## closed as off topic by Joe Fitzsimons, Peter Shor , Hsien-Chih Chang 張顯之, JɛﬀE, Mohammad Al-TurkistanyJun 9 '11 at 6:06

Questions on Theoretical Computer Science Stack Exchange are expected to relate to theoretical computer science within the scope defined in the FAQ. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about closed questions here.