Talk:Nondeterministic algorithm: Difference between revisions

Revision as of 10:46, 3 February 2024

Revision as of 22:02, 5 March 2024

Line 157:

:Thus mechanical Non-Deterministic Algorithms will not behave as expected, and not behave as their "paper and pencil" counterparts.

:Unitl this theory is explained there will be controversies over the term Non-Deterministic Algorithms. [[User:RoyMWiki|RoyMWiki]] ([[User talk:RoyMWiki|talk]]) 16:08, 16 April 2023 (UTC)

::Isn't that the point of artificial intelligence? We are literally trying to build systems where this is the case. From a practical standpoint there are "non-deterministic" systems out there which are outside of the control of the testing party, sure they could be deterministic if you got super scientific with it but to what extent is that practical vs just saying "its non deterministic". I'm sure we could invest enough to prove everything is in-fact deterministic but it would be quite expensive and impractical and what's the point? Just my 2 cents as an engineer working on systems like this every day. [[Special:Contributions/172.58.255.84|172.58.255.84]] ([[User talk:172.58.255.84|talk]]) 22:02, 5 March 2024 (UTC)