3 ms·
most cs programs have an undergraduate course called "cs theory" or "computability" which is usually some introduction to some theory behind language definition
by a-dub 5y ago
most cs programs have an undergraduate course called "cs theory" or "computability" which is usually some introduction to some theory behind language definition and language parsing followed by abstract models for computation (turing machines) and finally explorations of what's "computable." (google for "computability theory automata books" for a bunch of different texts)
the last one (what's computable) forms the basis for a lot of (all?) cryptography and is filled with all sorts of really fun and not at all hard to master proofs that are just reductions at their core.
- a-dub 5y agobut sort of getting more at your core point, borrowing across fields is basically a technique for problem solving. in domains like, applied math, what you tend to find is that everyone in different fields are often doing the same thing but have different names for it. statisticians, electrical engineers, data scientists and physicists will all often use the same math (linear systems) but with very different names attached.