<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=User%3ALinkBot%2Fsuggestions%2FAlgorithm</id>
	<title>User:LinkBot/suggestions/Algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=User%3ALinkBot%2Fsuggestions%2FAlgorithm"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=User:LinkBot/suggestions/Algorithm&amp;action=history"/>
	<updated>2026-05-05T18:06:35Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=User:LinkBot/suggestions/Algorithm&amp;diff=1014762&amp;oldid=prev</id>
		<title>imported&gt;Nickj: /* Outward links */ manual spot checking of results - remove 2 bad suggestions</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=User:LinkBot/suggestions/Algorithm&amp;diff=1014762&amp;oldid=prev"/>
		<updated>2004-12-17T10:36:21Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Outward links: &lt;/span&gt; manual spot checking of results - remove 2 bad suggestions&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;An [[User:Nickj/Link_Suggester|automated Wikipedia link suggester]] has suggested [[#Outward links|14 possible wiki links]] and [[#Inward links|14 possible backlinks]] for the [[Algorithm]] article:&lt;br /&gt;
&lt;br /&gt;
{{User:LinkBot/notes}}&lt;br /&gt;
{{User:LinkBot/feedback}} &amp;amp;mdash; [[User:LinkBot|LinkBot]] 10:24, 17 Dec 2004 (UTC)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Outward links===&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;finite set&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...en used to represent algorithms.]]  An &amp;#039;&amp;#039;&amp;#039;algorithm&amp;#039;&amp;#039;&amp;#039; is a&amp;lt;/nowiki&amp;gt; [[finite|finite set]]&amp;lt;nowiki&amp;gt; of well-defined instructions for accomplishing some task wh...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;well-defined&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...resent algorithms.]]  An &amp;#039;&amp;#039;&amp;#039;algorithm&amp;#039;&amp;#039;&amp;#039; is a finite set of&amp;lt;/nowiki&amp;gt; [[well-defined]]&amp;lt;nowiki&amp;gt; instructions for accomplishing some task which, given an in...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;potato salad&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...not appropriate to the problem. For example, performing the&amp;lt;/nowiki&amp;gt; [[Potato salad|potato salad]]&amp;lt;nowiki&amp;gt; algorithm will fail if there are no potatoes present, even ...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;multiplication algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...nt]]ed if a physical embodiment is possible (for example, a&amp;lt;/nowiki&amp;gt; [[Multiplication algorithm|multiplication algorithm]]&amp;lt;nowiki&amp;gt; may be embodied in the arithmetic unit of a microprocessor)...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;neural network&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...]]s, but often also by other means, such as in a biological&amp;lt;/nowiki&amp;gt; [[Neural network|neural network]]&amp;lt;nowiki&amp;gt; (for example, the human brain implementing [[arithmetic]] o...&amp;lt;/nowiki&amp;gt; ([[Algorithm#Implementing_algorithms|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;human brain&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...s, such as in a biological neural network (for example, the&amp;lt;/nowiki&amp;gt; [[Human brain|human brain]]&amp;lt;nowiki&amp;gt; implementing [[arithmetic]] or an insect relocating food), ...&amp;lt;/nowiki&amp;gt; ([[Algorithm#Implementing_algorithms|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;binary sequence&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...ies if there are more zeros than ones in an infinite random&amp;lt;/nowiki&amp;gt; [[Boolean function|binary sequence]]&amp;lt;nowiki&amp;gt; must run forever to be effective.  If it is implemented cor...&amp;lt;/nowiki&amp;gt; ([[Algorithm#Implementing_algorithms|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;random numbers&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...mple of an algorithm.  Imagine you have an unsorted list of&amp;lt;/nowiki&amp;gt; [[Random number|random numbers]]&amp;lt;nowiki&amp;gt;. Our goal is to find the highest number in this list. Upon ...&amp;lt;/nowiki&amp;gt; ([[Algorithm#Example|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;right-hand side&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;... used here indicates assignment.  That is, the value on the&amp;lt;/nowiki&amp;gt; [[Left-hand side and right-hand side of an equation|right-hand side]]&amp;lt;nowiki&amp;gt; of the expression is assigned to the container (or variable...&amp;lt;/nowiki&amp;gt; ([[Algorithm#Example|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;Addison Wesley&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...]:  &amp;#039;&amp;#039;[[The Art of Computer Programming]]&amp;#039;&amp;#039;, Vol 1&amp;amp;amp;ndash;3,&amp;lt;/nowiki&amp;gt; [[Pearson|Addison Wesley]]&amp;lt;nowiki&amp;gt; 1998. Widely held as a definitive reference. ISBN 020148541...&amp;lt;/nowiki&amp;gt; ([[Algorithm#References|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;Free source&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...tp://www.algana.co.uk/ &amp;#039;&amp;#039;Algorithm analysis and puzzles.&amp;#039;&amp;#039;]&amp;lt;/nowiki&amp;gt; [[Free software|Free source]]&amp;lt;nowiki&amp;gt; code for algorithm Java applets and C++ modules...&amp;lt;/nowiki&amp;gt; ([[Algorithm#External_links|link to section]])&lt;br /&gt;
* Can link &amp;#039;&amp;#039;&amp;#039;Gaston H. Gonnet&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...ee source code for algorithm Java applets and C++ modules *&amp;lt;/nowiki&amp;gt; [[Gastón Gonnet|Gaston H. Gonnet]]&amp;lt;nowiki&amp;gt; and Ricardo Baeza-Yates: Example programs from [http://www....&amp;lt;/nowiki&amp;gt; ([[Algorithm#External_links|link to section]])&lt;br /&gt;
&lt;br /&gt;
===Inward links===&lt;br /&gt;
Additionally, there are some other articles which may be able to linked to this one (also known as &amp;quot;backlinks&amp;quot;):&lt;br /&gt;
* In [[One-time pad#Achieving_Shannon_security|One-time pad]], can backlink &amp;#039;&amp;#039;&amp;#039;deterministic algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;... the device.  Linux also provides /dev/urandom which uses a&amp;lt;/nowiki&amp;gt; [[algorithm|deterministic algorithm]]&amp;lt;nowiki&amp;gt; to generate the data whenever environmental noise is unavai...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Radix sort|Radix sort]], can backlink &amp;#039;&amp;#039;&amp;#039;computer algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...inally used to sort [[punched card]]s in several passes.  A&amp;lt;/nowiki&amp;gt; [[algorithm|computer algorithm]]&amp;lt;nowiki&amp;gt; was invented for radix sort in 1954 at [[Massachusetts Inst...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Relational model#Controversies|Relational model]], can backlink &amp;#039;&amp;#039;&amp;#039;logical errors&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;... a three-valued logic system, but fell short of that due to&amp;lt;/nowiki&amp;gt; [[Algorithm|logical errors]]&amp;lt;nowiki&amp;gt; in the standard and in its implementations....&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Sharp-P-complete|Sharp-P-complete]], can backlink &amp;#039;&amp;#039;&amp;#039;deterministic algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...ult to solve exactly, then can it even be approximated?  No&amp;lt;/nowiki&amp;gt; [[algorithm|deterministic algorithm]]&amp;lt;nowiki&amp;gt; is known that can even find the approximate answer to withi...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Minimum spanning tree#Algorithms|Minimum spanning tree]], can backlink &amp;#039;&amp;#039;&amp;#039;deterministic algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...n that run in linear expected time.  Whether there exists a&amp;lt;/nowiki&amp;gt; [[algorithm|deterministic algorithm]]&amp;lt;nowiki&amp;gt; with linear running time for general weights is still an op...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Non-empty set|Non-empty set]], can backlink &amp;#039;&amp;#039;&amp;#039;logical errors&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...hematical hypotheses. One reason is that we can easily make&amp;lt;/nowiki&amp;gt; [[Algorithm|logical errors]]&amp;lt;nowiki&amp;gt; when we make hypotheses about the empty set, which is often...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Dead code|Dead code]], can backlink &amp;#039;&amp;#039;&amp;#039;logical errors&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...is never used.  The presence of dead code may reveal either&amp;lt;/nowiki&amp;gt; [[Algorithm|logical errors]]&amp;lt;nowiki&amp;gt; due to alterations in the program or significant changes in...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[C standard library#ANSI_C_library_header_files|C standard library]], can backlink &amp;#039;&amp;#039;&amp;#039;logical errors&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...&amp;#039;: Contains the assert macro, used to assist with detecting&amp;lt;/nowiki&amp;gt; [[Algorithm|logical errors]]&amp;lt;nowiki&amp;gt; and other types of bug in debugging versions of a program....&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Procedural knowledge|Procedural knowledge]], can backlink &amp;#039;&amp;#039;&amp;#039;computer algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...example, a computer expert might have [[knowledge]] about a&amp;lt;/nowiki&amp;gt; [[algorithm|computer algorithm]]&amp;lt;nowiki&amp;gt; in multiple languages, or in pseudo-code, whereas a Visual ...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Law School Admissions Test|Law School Admissions Test]], can backlink &amp;#039;&amp;#039;&amp;#039;logical errors&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...n assumptions, alternative arguments, logical omissions, or&amp;lt;/nowiki&amp;gt; [[Algorithm|logical errors]]&amp;lt;nowiki&amp;gt; in the statement....&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Key generation|Key generation]], can backlink &amp;#039;&amp;#039;&amp;#039;computer algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...eudo Random Number Generator ([[PRNG]]), the latter being a&amp;lt;/nowiki&amp;gt; [[algorithm|computer algorithm]]&amp;lt;nowiki&amp;gt; that produces data which appears random under analysis. Of ...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Killian documents#Allegedly_reproducible_using_modern_technology|Killian documents]], can backlink &amp;#039;&amp;#039;&amp;#039;computer algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...ingly made other errors through being hasty. Using a custom&amp;lt;/nowiki&amp;gt; [[algorithm|computer algorithm]]&amp;lt;nowiki&amp;gt; to find the best alignment between the scanned memo and the...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[Probabilistic encryption|Probabilistic encryption]], can backlink &amp;#039;&amp;#039;&amp;#039;deterministic algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...the plaintext with a random string before encrypting with a&amp;lt;/nowiki&amp;gt; [[algorithm|deterministic algorithm]]&amp;lt;nowiki&amp;gt;. Conversely, decryption involves applying a deterministic a...&amp;lt;/nowiki&amp;gt;&lt;br /&gt;
* In [[SL %28complexity%29#Important_results|SL (complexity)]], can backlink &amp;#039;&amp;#039;&amp;#039;deterministic algorithm&amp;#039;&amp;#039;&amp;#039;: &amp;lt;nowiki&amp;gt;...1992]], Nisan, Szemerédi, and Wigderson finally found a new&amp;lt;/nowiki&amp;gt; [[algorithm|deterministic algorithm]]&amp;lt;nowiki&amp;gt; to solve USTCON using only (log &amp;#039;&amp;#039;n&amp;#039;&amp;#039;)&amp;amp;lt;sup&amp;amp;gt;1.5&amp;amp;lt;/sup&amp;amp;gt; space....&amp;lt;/nowiki&amp;gt;&lt;/div&gt;</summary>
		<author><name>imported&gt;Nickj</name></author>
	</entry>
</feed>