Difference between revisions of "State (computer science)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→External links) |
Karl Jones (Talk | contribs) (→Description) |
||
| Line 9: | Line 9: | ||
* [[Computer science]] | * [[Computer science]] | ||
* [[Event-driven architecture]] | * [[Event-driven architecture]] | ||
| + | * [[Functional programming]] - a programming paradigm that treats computation as the evaluation of mathematical functions and avoids changing-state and [[Immutable object|mutable data]]. | ||
* [[Input/output]] | * [[Input/output]] | ||
* [[Input (computing)]] | * [[Input (computing)]] | ||
Revision as of 16:15, 22 August 2016
In computer science and automata theory, the state of a digital logic circuit or computer program is a technical term for all the stored information, at a given instant in time, to which the circuit or program has access.
Description
The output of a digital circuit or computer program at any time is completely determined by its current inputs and its state.
- Automata theory
- Computer program
- Computer science
- Event-driven architecture
- Functional programming - a programming paradigm that treats computation as the evaluation of mathematical functions and avoids changing-state and mutable data.
- Input/output
- Input (computing)
- Output (computing)
- Software architecture
External links
- State (computer science) @ Wikipedia
