Play Video
1
Deterministic algorithms
Deterministic algorithms
::2010/07/25::
Play Video
2
8.3 - Deterministic Selection Algorithm - Linear Time Selection - [DSA 1] By Tim Roughgarden
8.3 - Deterministic Selection Algorithm - Linear Time Selection - [DSA 1] By Tim Roughgarden
::2013/09/22::
Play Video
3
Non-deterministic algorithms
Non-deterministic algorithms
::2010/07/25::
Play Video
4
Shafi Goldwasser: Pseudo Deterministic Algorithms
Shafi Goldwasser: Pseudo Deterministic Algorithms
::2012/08/24::
Play Video
5
8.4 - Deterministic Selection Analysis 1 - Linear Time Selection - [DSA 1] By Tim Roughgarden
8.4 - Deterministic Selection Analysis 1 - Linear Time Selection - [DSA 1] By Tim Roughgarden
::2013/09/22::
Play Video
6
PACMAN trained with NON-deterministic Q-Learning Algorithm
PACMAN trained with NON-deterministic Q-Learning Algorithm
::2012/01/29::
Play Video
7
FTT Algorithm - Deterministic movement
FTT Algorithm - Deterministic movement
::2013/07/25::
Play Video
8
Metatron non deterministic test
Metatron non deterministic test
::2009/05/22::
Play Video
9
8.5 - Deterministic Selection Analysis 2 - Linear Time Selection - [DSA 1] By Tim Roughgarden
8.5 - Deterministic Selection Analysis 2 - Linear Time Selection - [DSA 1] By Tim Roughgarden
::2013/09/22::
Play Video
10
1 - Convert Regular Expression to Finite-State Automaton
1 - Convert Regular Expression to Finite-State Automaton
::2011/05/09::
Play Video
11
Gibbs sampling for motif inference (deterministic, 50 iterations)
Gibbs sampling for motif inference (deterministic, 50 iterations)
::2010/05/06::
Play Video
12
The Birds and the Bees
The Birds and the Bees
::2013/05/05::
Play Video
13
Probabilistic Analysis Algorithm for UASLOPE Software
Probabilistic Analysis Algorithm for UASLOPE Software
::2014/02/14::
Play Video
14
Global Optimization of MINLP by Evolutionary Algorithms
Global Optimization of MINLP by Evolutionary Algorithms
::2014/02/26::
Play Video
15
scrollbars
scrollbars
::2007/11/12::
Play Video
16
Quantum wave and particle track
Quantum wave and particle track
::2013/12/09::
Play Video
17
Solving parameter identification problem using genetic algorithms evolutionnary strategy -- N. HARB
Solving parameter identification problem using genetic algorithms evolutionnary strategy -- N. HARB
::2013/03/27::
Play Video
18
Deterministic Finite Automata ( DFA ) construction with Examples and solution Part 2
Deterministic Finite Automata ( DFA ) construction with Examples and solution Part 2
::2013/12/03::
Play Video
19
1 - 3 - 3. Deterministic finite automata-Automata-Professor Jeffrey Ullman
1 - 3 - 3. Deterministic finite automata-Automata-Professor Jeffrey Ullman
::2012/05/04::
Play Video
20
Convert NFA to DFA
Convert NFA to DFA
::2011/05/10::
Play Video
21
Deterministic finite automata
Deterministic finite automata
::2010/09/26::
Play Video
22
Simple Monte Carlo simulation examples in Excel
Simple Monte Carlo simulation examples in Excel
::2012/12/09::
Play Video
23
Deterministic Extremum Seeking Experiment
Deterministic Extremum Seeking Experiment
::2010/12/21::
Play Video
24
Foundation Fieldbus Link Active Scheduler Algorithm
Foundation Fieldbus Link Active Scheduler Algorithm
::2009/10/01::
Play Video
25
Lec-17 Other Issues - Introduction to Dynamic Programming
Lec-17 Other Issues - Introduction to Dynamic Programming
::2009/08/31::
Play Video
26
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability @ WAOA 2010 (3/3)
Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability @ WAOA 2010 (3/3)
::2010/09/14::
Play Video
27
How to Minimize DFA states
How to Minimize DFA states
::2013/02/01::
Play Video
28
Mapping Desktop to Mobile Devices - Deterministic Method
Mapping Desktop to Mobile Devices - Deterministic Method
::2013/11/21::
Play Video
29
Lec-21 Inventory Models - Deterministic Models
Lec-21 Inventory Models - Deterministic Models
::2009/08/31::
Play Video
30
Deterministic Finite Automata
Deterministic Finite Automata
::2010/11/18::
Play Video
31
Cellular automata a: Deterministic cellular automata
Cellular automata a: Deterministic cellular automata
::2012/08/24::
Play Video
32
L2: Regular Languages and Non-Deterministic FSMs
L2: Regular Languages and Non-Deterministic FSMs
::2012/12/12::
Play Video
33
Poissonian copy numbers a: Stochastic transcription and deterministic degradation
Poissonian copy numbers a: Stochastic transcription and deterministic degradation
::2013/03/13::
Play Video
34
Non-deterministic finite state automata from NDA to DFA
Non-deterministic finite state automata from NDA to DFA
::2011/05/21::
Play Video
35
Voice Controlled Interface 4 Digital Musical Instrument
Voice Controlled Interface 4 Digital Musical Instrument
::2013/10/21::
Play Video
36
Random Number Generator - Solution
Random Number Generator - Solution
::2012/08/04::
Play Video
37
OM Calculation: Project Management Network Analysis  Deterministic Time
OM Calculation: Project Management Network Analysis Deterministic Time
::2013/11/17::
Play Video
38
8.1 - Randomized Selection Algorithm - Linear Time Selection - [DSA 1] By Tim Roughgarden
8.1 - Randomized Selection Algorithm - Linear Time Selection - [DSA 1] By Tim Roughgarden
::2013/09/22::
Play Video
39
The Ultimate Scaling Limit -- A Deterministic Single Atom Transistor
The Ultimate Scaling Limit -- A Deterministic Single Atom Transistor
::2013/03/15::
Play Video
40
5.2- Quicksort Algorithm-Partition Around Pivot-[Data Structure And Algorithm 1] By Tim Roughgarden
5.2- Quicksort Algorithm-Partition Around Pivot-[Data Structure And Algorithm 1] By Tim Roughgarden
::2013/09/12::
Play Video
41
ECC2012 - Deterministic elliptic curve primality proving for special sequences
ECC2012 - Deterministic elliptic curve primality proving for special sequences
::2013/03/11::
Play Video
42
Travelling Salesman Problem - Nearest Neighbor Algorithm
Travelling Salesman Problem - Nearest Neighbor Algorithm
::2013/03/26::
Play Video
43
14.5 - Johnson
14.5 - Johnson's Algorithm 1 - All-Pairs Shortest Path - [DSA 2] - By Tim Roughgarden
::2013/10/09::
Play Video
44
8 - 2 - Deterministic Encryption -Cryptography-Professor Dan Boneh
8 - 2 - Deterministic Encryption -Cryptography-Professor Dan Boneh
::2012/04/18::
Play Video
45
10.7 - Computing Strong Components: Algorithm - Graph Search - [DSA 1] By Tim Roughgarden
10.7 - Computing Strong Components: Algorithm - Graph Search - [DSA 1] By Tim Roughgarden
::2013/09/28::
Play Video
46
Quine Mc Cluskey Method
Quine Mc Cluskey Method
::2013/05/19::
Play Video
47
3.1 - O(n log n) Part1 - Divide and Conquer Algorithm - [DSA 1] By Tim Roughgarden
3.1 - O(n log n) Part1 - Divide and Conquer Algorithm - [DSA 1] By Tim Roughgarden
::2013/09/10::
Play Video
48
mdpreview 1 02 Deterministic Answer.mp4
mdpreview 1 02 Deterministic Answer.mp4
::2011/11/15::
Play Video
49
Practical Programming Algorithm: Disjoint Sets
Practical Programming Algorithm: Disjoint Sets
::2013/06/17::
Play Video
50
3.3 - Strassens Matrix Multiplication - Divide and Conquer Algorithm.- [DSA 1]
3.3 - Strassens Matrix Multiplication - Divide and Conquer Algorithm.- [DSA 1]
::2013/09/10::
NEXT >>
RESULTS [51 .. 101]
From Wikipedia, the free encyclopedia
Jump to: navigation, search

In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. Deterministic algorithms are by far the most studied and familiar kind of algorithm, as well as one of the most practical, since they can be run on real machines efficiently.

Formally, a deterministic algorithm computes a mathematical function; a function has a unique value for any given input, and the algorithm is a process that produces this particular value as output.

Formal definition[edit]

Deterministic algorithms can be defined in terms of a state machine: a state describes what a machine is doing at a particular instant in time. State machines pass in a discrete manner from one state to another. Just after we enter the input, the machine is in its initial state or start state. If the machine is deterministic, this means that from this point onwards, its current state determines what its next state will be; its course through the set of states is predetermined. Note that a machine can be deterministic and still never stop or finish, and therefore fail to deliver a result.

Examples of particular abstract machines which are deterministic include the deterministic Turing machine and deterministic finite automaton.

What makes algorithms non-deterministic?[edit]

A variety of factors can cause an algorithm to behave in a way which is not deterministic, or non-deterministic:

  • If it uses external state other than the input, such as user input, a global variable, a hardware timer value, a random value, or stored disk data.
  • If it operates in a way that is timing-sensitive, for example if it has multiple processors writing to the same data at the same time. In this case, the precise order in which each processor writes its data will affect the result.
  • If a hardware error causes its state to change in an unexpected way.

Although real programs are rarely purely deterministic, it is easier for humans as well as other programs to reason about programs that are. For this reason, most programming languages and especially functional programming languages make an effort to prevent the above events from happening except under controlled conditions.

The prevalence of multi-core processors has resulted in a surge of interest in determinism in parallel programming and challenges of non-determinism have been well documented.[1][2] A number of tools to help deal with the challenges have been proposed[3][4][5][6][7] to deal with deadlocks and race conditions.

Problems with deterministic algorithms[edit]

Unfortunately, for some problems deterministic algorithms are also hard to find. For example, there are simple and efficient probabilistic algorithms that determine whether a given number is prime and have a very small chance of being wrong. These have been known since the 1970s (see for example Fermat primality test); the known deterministic algorithms remain considerably slower in practice.

As another example, NP-complete problems, which include many of the most important practical problems, can be solved quickly using a machine called a nondeterministic Turing machine, but efficient practical algorithms have never been found for any of them. At best, we can currently only find approximate solutions or solutions in special cases.

Another major problem with deterministic algorithms is that sometimes, we don't want the results to be predictable. For example, if you are playing an on-line game of blackjack that shuffles its deck using a pseudorandom number generator, a clever gambler might guess precisely the numbers the generator will choose and so determine the entire contents of the deck ahead of time, allowing him to cheat; for example, the Software Security Group at Reliable Software Technologies was able to do this for an implementation of Texas Hold 'em Poker that is distributed by ASF Software, Inc, allowing them to consistently predict the outcome of hands ahead of time.[8] Similar problems arise in cryptography, where private keys are often generated using such a generator. This sort of problem is generally avoided using a cryptographically secure pseudo-random number generator.

Determinism categories in languages[edit]

Mercury[edit]

This logic-functional programming language establish different determinism categories for predicate modes as explained in the ref.[9][10]

Haskell[edit]

Haskell provides several mechanisms:

non-determinism or notion of Fail
  • the Maybe and Either types include the notion of success in the result.
  • the fail method of the class Monad, may be used to signal fail as exception.
  • the Maybe monad and MaybeT monad transformer provide for failed computations (stop the computation sequence and return Nothing)[11]
determinism/non-det with multiple solutions
you may retrieve all possible outcomes of a multiple result computation, by wrapping its result type in a MonadPlus monad. (its method mzero makes an outcome fail and mplus collects the successful results).[12]

ML family and derived languages[edit]

As seen in Standard ML, OCaml and Scala

  • The option type includes the notion of success.

Java[edit]

  • The null reference value may represent an unsuccessful (out-of-domain) result.

References[edit]

  1. ^ Edward A. Lee. "The Problem with Threads". Retrieved 2009-05-29. 
  2. ^ James Reinders. "Parallel terminology definitions". Retrieved 2009-05-29. 
  3. ^ "Intel Parallel Inspector Thread Checker". Retrieved 2009-05-29. 
  4. ^ Yuan Lin. "Data Race and Deadlock Detection with Sun Studio Thread Analyzer". Retrieved 2009-05-29. 
  5. ^ Intel. "Intel Parallel Inspector". Retrieved 2009-05-29. 
  6. ^ David Worthington. "Intel addresses development life cycle with Parallel Studio". Retrieved 2009-05-26. 
  7. ^ Parallel Studio
  8. ^ Gary McGraw and John Viega. Make your software behave: Playing the numbers: How to cheat in online gambling. http://www.ibm.com/developerworks/library/s-playing/#h4
  9. ^ Determinism categories in the Mercury programming language
  10. ^ Mercury predicate modes
  11. ^ Representing failure using the Maybe monad
  12. ^ The class MonadPlus
Wikipedia content is licensed under the GFDL License
Powered by YouTube
LEGAL
  • Mashpedia © 2014