- Arithmetic operations(as used in mathematics and computing)
- Basic mathematical calculations like addition, subtraction, multiplication, and division.
- Bounded integers(as used in computer science)
- Whole numbers that have a maximum size limit—like when your computer only uses 32-bit or 64-bit numbers, which can't go higher than a certain value.
- Computational complexity(as used in epistemology and logic)
- A measure of how much time, computer power, or memory a problem requires to solve—some problems need so much that they're practically impossible for humans.
- RAM machine(Used as an alternative reference model of computation for defining time and space complexity)
- A computation model consisting of a finite sequence of instructions specifying how numerical operations (typically addition and subtraction) are to be applied to a sequence of registers whose values may be stored and retrieved directly by index; a simplified representation of the von Neumann architecture.
- Turing machine(Computability theory)
- A formal computational model defined to study the notion of computation, containing elementary arithmetic and capable of expressing universality, negation, and self-reference
- Uniform cost measure(as used in algorithm analysis)
- A way of counting the cost or difficulty of operations where every basic operation (like adding two numbers) counts as taking the same amount of time or resources, regardless of how big the numbers are.
- structurally cannot replicate(logic and metaphysics)
- Cannot achieve or reproduce in the same way, based on how the thing is fundamentally built or organized.