Theory of computation Flashcards
Abstraction
reduction of information and details to focus on essential characteristics
Representational abstraction
representation arrived at by removing unnecessary details
Abstraction by generalisation
when you group things by common characteristics to arrive at some kind of hierarchy
Procedural abstraction
result of abstracting away the actual values used in any particular computation in a computational method (procedure)
Information hiding
process of hiding all details of an object that do not contribute to its essential characteristics
Functional abstraction
particular computation method is hidden
Data abstraction
details of how data is actually represented are hidden - allows new kinds of data objects to be constructed from previously defined types of data objects
Decomposition
breaking a problem into a number of sub-problems, so that each sub-problem accomplishes an identifiable task
Composition
combining procedures to form compound procedures
Problem abstraction
involves removing details until the problem is represented in a way that is possible to solve
Automation
process of putting models into action to solve problems
Set
an unordered collection of distinct elements
Membership (∈)
element x is a member of set A
Cardinality
number of elements in a set - usually expressed using double vertical bars, | |
Empty set
unique set with no members
