File:Difference between deterministic and Nondeterministic.svg
Size of this PNG preview of this SVG file: 775 × 458 pixels. Other resolutions: 320 × 189 pixels | 640 × 378 pixels | 1,024 × 605 pixels | 1,280 × 756 pixels | 2,560 × 1,513 pixels.
Original file (SVG file, nominally 775 × 458 pixels, file size: 5 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: A deterministic algorithm that performs f(n) steps always finishes with an accept or reject state, and always finishes with the same result. A non-deterministic algorithm that is f(n) levels may return different values on different runs, and may never finish with an accept or reject state. |
| Date | |
| Source | Own work based on: Difference between deterministic and Nondeterministic.png by Eleschinski2000 |
| Author | Vectorization: Alhadis |
| SVG development |  |
|
This file supersedes the file Difference between deterministic and Nondeterministic.png. It is recommended to use this file rather than the other one.
|
|
Licensing
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 14:30, 8 December 2019 | | 775 × 458 (5 KB) | Alhadis | {{Information |description ={{en|1=A deterministic algorithm that performs f(n) steps always finishes with an "accept" or "reject" state, and always finishes with the same result. A non-deterministic algorithm that is f(n) levels may return different values on different runs, and may never finish with an accept or reject state.}} |date =2015-08-01 |source ={{Own based|Difference_between_deterministic_and_Nondeterministic.png|by=Eleschinski2000}} |author ={{Author|vec... |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
Global file usage
The following other wikis use this file:
- Usage on es.wikipedia.org
- Usage on ko.wikipedia.org
- Usage on lmo.wikipedia.org
