Determination: Difference between revisions
Jump to navigation
Jump to search
| [checked revision] | [checked revision] |
No edit summary |
CryptoUser (talk | contribs) m (CryptoUser moved page Commoninfo:determination to Determination) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{#seo: | {{#seo: | ||
|title= | |title= Determination — Decimal Wiki | ||
|titlemode= append | |||
|keywords= Determination | |keywords= Determination | ||
|description= Determination | |description= Determination | ||
}} | }} | ||
'''Determinism''' (from Lat. ''determinans'' — determinant) — certainty. | |||
'''Determinism''' (from Lat. determinans — determinant) — certainty. | |||
Determinism may imply definability for a particular algorithm. The rigid determinism of processes in the world means that each consequence has a strictly defined cause. In this sense, determinism is the antonym of '''randomness.''' | Determinism may imply definability for a particular algorithm. The rigid determinism of processes in the world means that each consequence has a strictly defined cause. In this sense, determinism is the antonym of '''randomness.''' | ||
| Line 22: | Line 11: | ||
But determinism does not always equal predestination. For example, there may be determinism by the future, when the subject assumes that the goals for the future determine his behavior in the present. | But determinism does not always equal predestination. For example, there may be determinism by the future, when the subject assumes that the goals for the future determine his behavior in the present. | ||
Determinism in solving a practical problem or in an algorithm means that the method of solving the problem is uniquely defined in the form of a sequence of steps. No ambiguities or omissions are allowed on any of them. | Determinism in solving a practical problem or in an [[algorithm]] means that the method of solving the problem is uniquely defined in the form of a sequence of steps. No ambiguities or omissions are allowed on any of them. | ||
{{comment|When applying an algorithm to the same source data, the same result should always be obtained, therefore, for example, the process of information transformation, in which a [[coin]] toss is involved, is not deterministic and cannot be called an algorithm.}} | |||
[[Category:Commoninfo]] | |||
Latest revision as of 12:52, 9 February 2024
Determinism (from Lat. determinans — determinant) — certainty.
Determinism may imply definability for a particular algorithm. The rigid determinism of processes in the world means that each consequence has a strictly defined cause. In this sense, determinism is the antonym of randomness.
But determinism does not always equal predestination. For example, there may be determinism by the future, when the subject assumes that the goals for the future determine his behavior in the present.
Determinism in solving a practical problem or in an algorithm means that the method of solving the problem is uniquely defined in the form of a sequence of steps. No ambiguities or omissions are allowed on any of them.
When applying an algorithm to the same source data, the same result should always be obtained, therefore, for example, the process of information transformation, in which a coin toss is involved, is not deterministic and cannot be called an algorithm.