Deterministic system: Revision history

15 February 2023

• curprev 11:0511:05, 15 February 2023‎ Hoc talk contribs‎ 3,662 bytes +169‎ Correct and clarify ASAP re types/token: algorithms are/aren't deterministic; invocations are/aren't determinate
• curprev 06:3006:30, 15 February 2023‎ RobLa talk contribs‎ 3,493 bytes +38‎ Linking to randomness, and creating #Example and #Randomness sections Tag: Visual edit
• curprev 06:0106:01, 15 February 2023‎ RobLa talk contribs‎ 3,455 bytes +48‎ +Category:Glossary, +Category:Mathematics
• curprev 05:5805:58, 15 February 2023‎ RobLa talk contribs‎ 3,407 bytes +12‎ replacing "determinate" with "deterministic"
• curprev 05:5405:54, 15 February 2023‎ RobLa talk contribs‎ m 3,395 bytes 0‎ RobLa moved page Determinate to Deterministic system: Matching up with w:Deterministic system
• curprev 05:5305:53, 15 February 2023‎ RobLa talk contribs‎ 3,395 bytes +850‎ Copied intro text from w:deterministic system (<https://en.wikipedia.org/w/index.php?title=Deterministic_system&oldid=1092966327>)

12 February 2023

• curprev 17:2917:29, 12 February 2023‎ Hoc talk contribs‎ m 2,545 bytes +10‎ No edit summary
• curprev 15:4715:47, 12 February 2023‎ Hoc talk contribs‎ 2,535 bytes +2,535‎ Created page with " Formally, the output of an algorithm or decision procedure is 'determinate' ''if and only if'' it is a pure function of the input. Strictly, ''determinate'' applies only to invocations: if, regardless of the input, the output of an algorithm is always determinate whenever the algorithm terminates, then the algorithm is 'deterministic' ''if and only if'' its termination is also determinate. (This latter condition is trivially satisfied if the algorithm always terminate..."