Talk:Deterministic algorithm - Revision history

Cewbot: Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computing}}, {{WikiProject Computer science}}.

2024-01-10T13:58:30Z

Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Merge {{VA}} into {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{WikiProject Computing}}, {{WikiProject Computer science}}.

← Previous revision		Revision as of 13:58, 10 January 2024
Line 1:		Line 1:
	{{~~Vital~~ ~~article~~\|class=Start\|~~level~~=5\|~~topic~~=~~Mathematics}}~~		{{WikiProject banner shell\|class=Start\|vital=yes\|1=
	{{WikiProject ~~banner shell~~\|1=		{{WikiProject Computing\|importance=}}
	{{WikiProject ~~Computing\|class=Start~~\|importance=}}		{{WikiProject Computer science\|importance=high}}
	{{WikiProject Computer science\|importance=high\|class=start}}
	}}		}}

67.198.37.16: remove wikiproject maths banner

2023-11-18T00:36:57Z

remove wikiproject maths banner

← Previous revision		Revision as of 00:36, 18 November 2023
Line 1:		Line 1:
	{{Vital article\|class=Start\|level=5\|topic=Mathematics}}		{{Vital article\|class=Start\|level=5\|topic=Mathematics}}
	{{WikiProject banner shell\|1=		{{WikiProject banner shell\|1=
	{{WikiProject Mathematics\|class=
	}}
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}

Smasongarrison: Category:Wikipedia vital articles in Mathematics, Added {{WikiProject Mathematics}}

2023-02-16T03:09:52Z

Category:Wikipedia vital articles in Mathematics, Added {{WikiProject Mathematics}}

← Previous revision		Revision as of 03:09, 16 February 2023
Line 1:		Line 1:
	{{Vital article\|class=Start\|level=5\|topic=Mathematics}}		{{Vital article\|class=Start\|level=5\|topic=Mathematics}}
			{{WikiProject banner shell\|1=
			{{WikiProject Mathematics\|class=
			}}
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}
			}}

	==German Determinismus/Determiniertheit==		==German Determinismus/Determiniertheit==

RenatUK: Fixed {{Vital article}}; WP:TALKORDER

2021-08-04T00:06:08Z

Fixed {{Vital article}}; WP:TALKORDER

← Previous revision		Revision as of 00:06, 4 August 2021
Line 1:		Line 1:
		⚫	{{Vital article\|class=Start\|level=5\|topic=Mathematics}}
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}
⚫	{{Vital article\|class=Start\|level=5\|~~link~~=~~Wikipedia:Vital articles/Level/5/~~Mathematics~~\|anchor=Algorithms (25 articles)~~}}

	==German Determinismus/Determiniertheit==		==German Determinismus/Determiniertheit==

Cewbot: Maintain {{Vital article}}: The article is listed in the level 5 page: Algorithms (25 articles)

2021-01-30T08:11:11Z

Maintain {{Vital article}}: The article is listed in the level 5 page: Algorithms (25 articles)

← Previous revision		Revision as of 08:11, 30 January 2021
Line 1:		Line 1:
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}
			{{Vital article\|class=Start\|level=5\|link=Wikipedia:Vital articles/Level/5/Mathematics\|anchor=Algorithms (25 articles)}}

	==German Determinismus/Determiniertheit==		==German Determinismus/Determiniertheit==

WurmWoode at 23:57, 7 February 2016

2016-02-07T23:57:50Z

← Previous revision		Revision as of 23:57, 7 February 2016
Line 1:		Line 1:
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}

			==German Determinismus/Determiniertheit==
	In German you have to distinguish between [[:de:Determinismus (Algorithmus)]] and [[:de:Determiniertheit (Algorithmus)]]. After reading the definition of "deterministic algorithm" in this article, I would say "deterministic algorithm" is equivalent to German ''Determinismus''. But how would you say ''Determiniertheit'' in English? --[[User:Abdull\|Abdull]] 22:01, 27 October 2005 (UTC)		In German you have to distinguish between [[:de:Determinismus (Algorithmus)]] and [[:de:Determiniertheit (Algorithmus)]]. After reading the definition of "deterministic algorithm" in this article, I would say "deterministic algorithm" is equivalent to German ''Determinismus''. But how would you say ''Determiniertheit'' in English? --[[User:Abdull\|Abdull]] 22:01, 27 October 2005 (UTC)

Line 12:		Line 14:

	== Imaginary? ==		== Imaginary? ==

	can be quickly solved using an <big>imaginary massively parallel</big> machine		can be quickly solved using an <big>imaginary massively parallel</big> machine
	called a [[nondeterministic Turing machine]], but efficient practical		called a [[nondeterministic Turing machine]], but efficient practical

Timkaler: /* Non-deterministic turing machines don't belong in this article */

2014-10-07T21:57:48Z

Non-deterministic turing machines don't belong in this article

← Previous revision		Revision as of 21:57, 7 October 2014
Line 35:		Line 35:
	I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2001:470:8B2D:827:14CA:27F1:4678:B842\|2001:470:8B2D:827:14CA:27F1:4678:B842]] ([[User talk:2001:470:8B2D:827:14CA:27F1:4678:B842\|talk]]) 20:12, 6 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->		I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2001:470:8B2D:827:14CA:27F1:4678:B842\|2001:470:8B2D:827:14CA:27F1:4678:B842]] ([[User talk:2001:470:8B2D:827:14CA:27F1:4678:B842\|talk]]) 20:12, 6 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

	I rewrote this section. The conflation of nondeterministic turing machines and programs with nondeterministic output is a serious mistake on the part of the original authors of that section. Please do not revert or add back that argument without first explaining your perspective on a talk page.-Tim Kaler 21:57, 7 October 2014 (UTC)		I rewrote this section based on the above observation (it appears the text that was "deleted" was added back at some point). The conflation of nondeterministic turing machines and programs with nondeterministic output is a serious mistake on the part of the original authors of that section. Please do not revert or add back that argument without first explaining your perspective on a talk page.-Tim Kaler 21:57, 7 October 2014 (UTC)

Timkaler: /* Non-deterministic turing machines don't belong in this article */

2014-10-07T21:57:16Z

Non-deterministic turing machines don't belong in this article

← Previous revision		Revision as of 21:57, 7 October 2014
Line 34:		Line 34:

	I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2001:470:8B2D:827:14CA:27F1:4678:B842\|2001:470:8B2D:827:14CA:27F1:4678:B842]] ([[User talk:2001:470:8B2D:827:14CA:27F1:4678:B842\|talk]]) 20:12, 6 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->		I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2001:470:8B2D:827:14CA:27F1:4678:B842\|2001:470:8B2D:827:14CA:27F1:4678:B842]] ([[User talk:2001:470:8B2D:827:14CA:27F1:4678:B842\|talk]]) 20:12, 6 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

			I rewrote this section. The conflation of nondeterministic turing machines and programs with nondeterministic output is a serious mistake on the part of the original authors of that section. Please do not revert or add back that argument without first explaining your perspective on a talk page.-Tim Kaler 21:57, 7 October 2014 (UTC)

Wikiedit738 at 09:50, 13 June 2014

2014-06-13T09:50:33Z

← Previous revision		Revision as of 09:50, 13 June 2014
Line 2:		Line 2:
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}
	In German you have to distinguish between [[:de:Determinismus (Algorithmus)]] and [[:de:Determiniertheit (Algorithmus)]]. After reading the definition of "deterministic algorithm" in this article, I would say "deterministic algorithm" is equivalent to German ''Determinismus''. But how would you say ''Determiniertheit'' in English? --[[User:Abdull\|Abdull]] 22:01, 27 October 2005 (UTC)		In German you have to distinguish between [[:de:Determinismus (Algorithmus)]] and [[:de:Determiniertheit (Algorithmus)]]. After reading the definition of "deterministic algorithm" in this article, I would say "deterministic algorithm" is equivalent to German ''Determinismus''. But how would you say ''Determiniertheit'' in English? --[[User:Abdull\|Abdull]] 22:01, 27 October 2005 (UTC)

			If I understand your question correctly, Abdull, then this is related: the article does not properly distinguish different senses of determinism:
			*algorithms which always give the same output for each input
			*algorithms which always pass through the same states for each input
			*algorithms which always run in the same amount of time for each input
			I got here via a link on the page [[Real-time operating system]] which seems to take the third view, but this is not justified based on the page's contents.

			Not sure how to proceed. --[[User:Wikiedit738\|Wikiedit738]] ([[User talk:Wikiedit738\|talk]]) 09:50, 13 June 2014 (UTC)

	== Imaginary? ==		== Imaginary? ==

SineBot: Signing comment by 2001:470:8B2D:827:14CA:27F1:4678:B842 - ""

2014-05-06T20:13:33Z

Signing comment by 2001:470:8B2D:827:14CA:27F1:4678:B842 - ""

← Previous revision		Revision as of 20:13, 6 May 2014
Line 25:		Line 25:
	== Non-deterministic turing machines don't belong in this article ==		== Non-deterministic turing machines don't belong in this article ==

	I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article.		I just deleted some text in "disadvantages" which seemed to suggest that nondeterministic algorithms can solve NP hard problems more efficiently than deterministic algorithms. If nondeterministic turing machines are mentioned at all in this article, it should be to clarify to the reader that such machines are not related to the topic of the article. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2001:470:8B2D:827:14CA:27F1:4678:B842\|2001:470:8B2D:827:14CA:27F1:4678:B842]] ([[User talk:2001:470:8B2D:827:14CA:27F1:4678:B842\|talk]]) 20:12, 6 May 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

← Previous revision		Revision as of 13:58, 10 January 2024
Line 1:		Line 1:
	{{~~Vital~~ ~~article~~\|class=Start\|~~level~~=5\|~~topic~~=~~Mathematics}}~~		{{WikiProject banner shell\|class=Start\|vital=yes\|1=
	{{WikiProject ~~banner shell~~\|1=		{{WikiProject Computing\|importance=}}
	{{WikiProject ~~Computing\|class=Start~~\|importance=}}		{{WikiProject Computer science\|importance=high}}
	{{WikiProject Computer science\|importance=high\|class=start}}
	}}		}}

← Previous revision		Revision as of 00:36, 18 November 2023
Line 1:		Line 1:
	{{Vital article\|class=Start\|level=5\|topic=Mathematics}}		{{Vital article\|class=Start\|level=5\|topic=Mathematics}}
	{{WikiProject banner shell\|1=		{{WikiProject banner shell\|1=
	{{WikiProject Mathematics\|class=
	}}
	{{WikiProject Computing\|class=Start\|importance=}}		{{WikiProject Computing\|class=Start\|importance=}}
	{{WikiProject Computer science\|importance=high\|class=start}}		{{WikiProject Computer science\|importance=high\|class=start}}