Indeterminacy in computation: Difference between revisions

Content deleted Content added
disambig page made ambiguous: it doesn't really know if it wants to be an article in the first place
tag with {{broad-concept article}}
 
(2 intermediate revisions by 2 users not shown)
Line 1:
{{Broad-concept article}}
 
'''Indeterminacy''' is a property of [[formal system]]s that evolve in time (often conceptualized as a [[computation]]), in which complete information about the ''internal'' state of the system at some point in time admits multiple future trajectories.
 
In simpler terms, if such a system is returned to the same initial condition—or two identical copies of the system are started at the same time—they won't with certainty produce the same behaviour, as some element of chance is able to enter the system from outside it'sits formal specification.
 
In some cases the indeterminacy arises from the laws of [[physics]], in other cases it leaks in from the [[abstract model]], and sometimes the model includes an explicit source of indeterminacy, as with deliberately [[randomized algorithm]]s, for the benefits that this provides.
 
==Disambiguation==
 
'''IndeterminancyIndeterminacy in computation''' may refer to:
 
* [[quantum indeterminacy]] in [[quantum computer]]scomputers
* [[nondeterministic finite automata]]
* [[nondeterministic algorithm]]
In '''concurrency''':
* [[indeterminacy in concurrent computation]]
* [[unbounded nondeterminism]]
 
{{disambigdisambiguation}}