3 ms·
Reference needed: Once upon a time Turing Machines were my thing. But that was decades ago. Now I think I have a result that's interesting, following up on grad
by Nomentatus 10y ago
Reference needed:
Once upon a time Turing Machines were my thing. But that was decades ago. Now I think I have a result that's interesting, following up on graduate school work I did way back when... but... reading such things as the P=NP prize problem definition I see that at least some terminology in the field has changed, or at least, concepts have been added. (Such as "language", if I remember rightly.) Can someone point me to sources that will allow me to translate Turing oldspeak into Turing newspeak, and vice versa?
- throwawayaccnt3 10y agoIf investigating a specific result, I would recommend Wikipedia, ComplexityZoo and yes, even CSTheory.StackExchange. There are more comprehensive documents, however (re)learning a field may be an overinvestment to test a single idea.
- Nomentatus 10y agoCertainly it's not in Wikipedia, and if Google knows about it; I've probably visited it. A question in CSTheory.StackExchange might work, though.
- throwawayaccnt3 10y agoWikipedia won't have an entry on every specific problem, but it can come in handy if there's a general idea of what to search for. A quick investigation on "language" reveals "Formal Language" and "Model Theory" are relevant topics.