Alan's Skill: Theoretical Computability
- CompetencyExpert
- Description
The formal study of the mathematical limits of computation, focusing on what can and cannot be solved by algorithmic models such as automata and abstract machines.
Evidence Performed using Theoretical Computability
- TypeDetails(name, duration, recency, competencyDurationRecencyCompetency)Name
- Mathematical Logic and the Turing MachineFor 5 years89 years agoExpert3