Comment Re:Seriously, a practical implication? (Score 1) 288
Abstract notions like computability on Turing machines and NP completeness are most useful to prove lower bounds, eg. what cannot be computed at all, or not efficiently. For example, the general access control problem is not decidable. Thus, don't waste your time on it, but shoot for something less general.
Perhaps a TM can have an application, but that's not the only point.
Perhaps a TM can have an application, but that's not the only point.
