Now, as a software engineer, there are a number of topics in theoretical computer science that interest me that fall into the realm of computer science (theoretical or not), but at a much simpler level than it appears many of the questions here discuss:
- Automata Theory
- Computability Theory
- Computational Complexity / Analysis of Algorithms
- Algorithms and Data Structures (probably beyond scope here - my interested is in the applied, not theoretical)
- Artificial Intelligence (probably beyond scope here - my interested is in the applied, not theoretical)
- Computer Vision (probably beyond scope here - my interested is in the applied, not theoretical)
- Image Processing (probably beyond scope here - my interested is in the applied, not theoretical)
- Data Communication (potentially beyond scope, but I can see the theoretical underpinnings being within scope)
- Programming Language Theories (potentially beyond scope, but there are mathematical underpinnings to the design/implementation of programming languages and compilers/interpreters that would probably be within scope)
- Models of Concurrency
- Models of Parallel Computing
- Models of Distributed Computing
So, my questions:
- What difficulty of questions are acceptable? My experience in theoretical computer science is limited, but I'm still interested in the theories that underpin what I do.
- What topics are specifically considered a subset of theoretical computer science? I'm looking for someplace where I can ask and get answers to questions in (at least a subset of) the above-listed topics, which are unarguably topics within computer science, but potentially not within theoretical computer science. If this is not the place, can someone point me to a Stack Exchange where these are potentially within scope?