Timeline for Are questions about theoretical computers on-topic?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2016 at 6:38 | comment | added | Raphael Mod | @Kaveh All true. My point is, if we were to label them programming questions and make them offtopic, the perceived loss may be minimal since we dislike such questions anyway. | |
| Apr 7, 2016 at 23:28 | comment | added | Kaveh | @Raphael, Whether we like a question or not is not the same as the question being on-topic or not. They are computer science questions so they are by default they on-topic. If there is a relevant policy or meta discussion that I have forgotten about please remind me. | |
| Apr 7, 2016 at 15:44 | comment | added | Raphael Mod | Since when do we like these questions, @Kaveh? Plus, do we ever answer these with a program (meaning the formal representation of the automaton/machine)? Usually, we give them an algorithmic sketch they have to implement themselves. | |
| Apr 5, 2016 at 23:06 | comment | added | Kaveh | I think it is a bit more complicated. How about this one: give a Turing machine that copies its input? or adds two binary numbers? Note that these are typical exercises in a theory of computation course to asked to make sure students understand how a Turing machine works but are not difficult programming questions. Similar questions about designing DFAs/NFAs/PDAs, grammars, etc. Also similar questions about TTE model are actually important for computability in analysis. | |
| Apr 5, 2016 at 18:53 | history | answered | D.W.Mod | CC BY-SA 3.0 |