Difference between revisions of "State (computer science)"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(Description)
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
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]].
+
In [[computer science]] and [[automata theory]], the '''state''' of a [[logic gate]] 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 ==
 
== 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)]]
Line 17: Line 18:
  
 
* [https://en.wikipedia.org/wiki/State_(computer_science) State (computer science)] @ Wikipedia
 
* [https://en.wikipedia.org/wiki/State_(computer_science) State (computer science)] @ Wikipedia
 +
 +
[[Category:Computer science]]

Latest revision as of 16:22, 22 August 2016

In computer science and automata theory, the state of a logic gate 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.

External links