IEEE Computer Society - Keywords - Theory of Computation
F.0General
back to top
F.1Computation by Abstract Devices
F.1.0General
F.1.1Models of Computation
F.1.1.aAutomata
F.1.1.bBounded-action devices
F.1.1.cComputability theory
F.1.1.dRelations between models
F.1.1.eSelf-modifying machines
F.1.1.fUnbounded-action devices
F.1.2Modes of Computation
F.1.2.aAlternation and nondeterminism
F.1.2.bInteractive and reactive computation
F.1.2.cOnline computation
F.1.2.dParallelism and concurrency
F.1.2.eProbabilistic computation
F.1.2.fRelations among modes
F.1.2.gRelativized computation
F.1.3Complexity Measures and Classes
F.1.3.aComplexity hierarchies
F.1.3.bMachine-independent complexity
F.1.3.cReducibility and completeness
F.1.3.dRelations among complexity classes
F.1.3.eRelations among complexity measures
F.1.mMiscellaneous
back to top
F.2Analysis of Algorithms and Problem Complexity
F.2.0General
F.2.1Numerical Algorithms and Problems
F.2.1.aComputation of transforms
F.2.1.bComputations in finite fields
F.2.1.cComputations on matrices
F.2.1.dComputations on polynomials
F.2.1.eNumber-theoretic computations
F.2.2Nonnumerical Algorithms and Problems
F.2.2.aComplexity of proof procedures
F.2.2.bComputations on discrete structures
F.2.2.cGeometrical problems and computations
F.2.2.dPattern matching
F.2.2.eRouting and layout
F.2.2.fSequencing and scheduling
F.2.2.gSorting and searching
F.2.3Tradeoffs between Complexity Measures
F.2.mMiscellaneous
back to top
F.3Logics and Meanings of Programs
F.3.0General
F.3.1Specifying and Verifying and Reasoning about Programs
F.3.1.aAssertions
F.3.1.bInvariants
F.3.1.cLogics of programs
F.3.1.dMechanical verification
F.3.1.ePre- and post-conditions
F.3.1.fSpecification techniques
F.3.2Semantics of Programming Languages
F.3.2.aAlgebraic approaches to semantics
F.3.2.bDenotational semantics
F.3.2.cOperational semantics
F.3.2.dPartial evaluation
F.3.2.eProcess models
F.3.2.fProgram analysis
F.3.3Studies of Program Constructs
F.3.3.aControl primitives
F.3.3.bFunctional constructs
F.3.3.cObject-oriented constructs
F.3.3.dProgram and recursion schemes
F.3.3.eType structure
F.3.mMiscellaneous
back to top
F.4Mathematical logic and Formal Languages
F.4.0General
F.4.1Mathematical Logic
F.4.1.aComputability theory
F.4.1.bComputational logic
F.4.1.cLambda calculus and related systems
F.4.1.dLogic and constraint programming
F.4.1.eMechanical theorem proving
F.4.1.fModal logic
F.4.1.gModel theory
F.4.1.hProof theory
F.4.1.iRecursive function theory
F.4.1.jSet theory
F.4.1.kTemporal logic
F.4.2Grammars and Other Rewriting Systems
F.4.2.aDecision problems
F.4.2.bGrammar types
F.4.2.cParallel rewriting systems
F.4.2.dParsing
F.4.2.eThue systems
F.4.3Formal Languages
F.4.3.aAlgebraic language theory
F.4.3.bClasses defined by grammars or automata
F.4.3.cClasses defined by resource-bounded automata
F.4.3.dDecision problems
F.4.3.eOperations on languages
F.4.mMiscellaneous
back to top
F.mMiscellaneous
back to top
This is an extended version of the ACM Computing Classification System
Copyright (c) 2002 ACM, used with permission
