25,161
edits
Changes
Tech
,Created page with "'''Home * Engines * Tech''' [[FILE:Technophilia.JPG|border|right|thumb|[https://en.wikipedia.org/wiki/Technophilia Technophilia] <ref>[https://en.wikipedia...."
'''[[Main Page|Home]] * [[Engines]] * Tech'''
[[FILE:Technophilia.JPG|border|right|thumb|[https://en.wikipedia.org/wiki/Technophilia Technophilia] <ref>[https://en.wikipedia.org/wiki/Ceramic_art#Terracotta_.28artworks.29 Terracotta artwork] by [[Arts#GerhardHahn|Gerhard Hahn]], from the [https://www.lwl.org/industriemuseum/standorte/henrichshuette-hattingen/sonderausstellung/technophilia Technophilia] art exhibition at [https://www.lwl.org/industriemuseum/standorte/henrichshuette-hattingen/english Henrichshütte Ironworks - Museum of iron and steel], [https://en.wikipedia.org/wiki/Hattingen Hattingen], [https://en.wikipedia.org/wiki/North_Rhine-Westphalia North Rhine-Westphalia], [https://en.wikipedia.org/wiki/Germany Germany], part of [[Arts#IndustrialHeritageTrail|The Industrial Heritage Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], Photo by [[Gerd Isenberg]], October 01, 2016</ref> ]]
'''The Technology Chess Program''',<br/>
abbreviated '''Tech''', was one of the predecessors of modern chess programs, using a [[Claude Shannon|Shannon]] [[Type A Strategy]]. In [[Timeline#1970|1970]] Tech was written in [https://en.wikipedia.org/wiki/BLISS BLISS], a system programming language developed at [[Carnegie Mellon University]], and in 1977 ported to [[C]]. Primary Author was [[James Gillogly]] from Carnegie Mellon. [[Hans Berliner]] helped in developing the positional analysis ([[Evaluation|evaluation]]). The basic idea of the Tech program is due in large part to [[Allen Newell]]. In 1978 Gillogly wrote his Ph.D. Thesis about the performance analysis of Tech <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>. Tech competed at three [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], and was two times runner-up at [[ACM 1971]] and [[ACM 1972]].
=Quotes=
Quotes from ''The Technology Chess Program'' by [[James Gillogly]] <ref>[[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 3, pp. 145-163, reprinted ('''1988''') in [[Computer Chess Compendium]]</ref>.
==Abstract==
A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a [[Brute-Force|brute force search]] of the move tree with no [[Pruning|forward pruning]], using [[Material|material]] as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal. Because of the transparent structure, this program is proposed as a technological [[Various Classifications#Benchmark|benchmark]] for chess programs which will continue to improve as computer technology increases.
==Chess and Technology==
Until recently the main effort in chess programming has been to develop programs which selectively (and hopefully "intelligently") examine a small subset of the legal moves in any position. The surprising performance of the [[Daly CP|Varian minicomputer]] (programmed by [[Kenneth L. King|K. King]] and [[Chris Daly|C. Daly]]) in the [[ACM 1970|First Annual Computer Chess Championship]] (New York 1970), although due primarily to good luck in the pairings, led to increased speculation about the possibility of playing respectable chess with an unselective "brute force" program.
==Acknowledgments==
I am indebted to [[Hans Berliner]], World Correspondence Chess Champion, who developed the elegant techniques used in the positional analysis, and whose patient discussion helped to clarify many of the conceptional problems. The basic idea of the Technology Program is due in large part to [[Allen Newell]].
=Selected Games=
[[ACM 1971]], round 3, [[Coko|Coko 3]] - [[Tech]] <ref>[http://www.csvn.nl/index.php?option=com_docman&task=cat_view&gid=60&Itemid=26&lang=en PGN Download NACCC], [[CSVN]] site</ref>
<pre>
[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.04"]
[Round "3"]
[White "Coko 3"]
[Black "Tech"]
[Result "0-1"]
1.e4 e5 2.Nf3 Nc6 3.Bc4 Nf6 4.d3 d5 5.Bxd5 Nxd5 6.exd5 Qxd5 7.Nc3 Bb4 8.O-O Bxc3
9.bxc3 O-O 10.Ng5 Bf5 11.Rb1 f6 12.c4 Qc5 13.Nh3 Bxh3 14.Be3 Nd4 15.gxh3 Qc6 16.c3
Nf3+ 17.Kh1 Nd2+ 18.f3 Nxf1 19.Qxf1 f5 20.Rb5 f4 21.Rc5 Qe6 22.Bc1 c6 23.d4 Rae8
24.Rxe5 Qg6 25.Rxe8 Qxe8 26.Qf2 Qe6 27.Qf1 Rf5 28.h4 c5 29.d5 Qd6 30.Qh3 Qe5 31.Qf1
Qxc3 32.d6 Qd4 33.Qe2 Qxd6 34.Qe8+ Rf8 35.Qa4 Rf5 36.Qe8+ Rf8 37.Qa4 Qe6 38.Qb3 Qe2
39.h3 Rd8 40.Bxf4 Rd1+ 0-1
</pre>
<span id="Tech2"></span>
=Tech 2=
[[Massachusetts Institute of Technology|MIT]]-student [[Alan Baisley]], who already contributed as chess expert and [[Opening Book Authors|opening book-author]], implemented '''Tech 2''' in [[Assembly|assembly]] language on a [[PDP-10]] and gained about 25% in speed over the BLISS version on the same machine <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>. ''Tech 2'' competed at the [[WCCC 1974|1st World Computer Chess Championship]] in Stockholm 1974 and became fifth with two wins and losses against [[Kaissa]] and [[Chess (Program)|Chess 4.0]] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=44 Tech's ICGA Tournaments]</ref>, placed second at the [[ACM 1973]], and further played the [[ACM 1974]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cdeeb The eleventh ACM's North American Computer Chess Championship, Nashville, Tennessee October 26-28, 1980], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1980_11th_ACM_NACCC/The_Eleventh_ACMs_North_American_Computer_Chess_Championship.1980.062303015.sm.pdf pdf] from [[The Computer History Museum]], see History of ACM events pg 11</ref> .
<span id="Tech3"></span>
=Tech 3=
'''Tech 3''' was an own program in the spirit of Tech by [[Alexander Szabo]] as subject of his Masters thesis at [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia] in 1984. Tech 3 performed a [[Brute-Force|brute force]] [[Alpha-Beta|alpha-beta search]] with [[Quiescence Search|quiescence]] and [[Iterative Deepening|iterative deepening]] with [[Aspiration Windows|aspiration windows]] , using a [[Transposition Table|transposition table]] with [[Zobrist Hashing|Zobrist hashing]], and still the rudimentary [[Evaluation|evaluation]] only based on [[Material|material balance]]. Tech 3 was written in [[Fortran]] and [[IBM 370]] [[Assembly]] to run on a [[Amdahl 470|Amdahl 470V/8]], the source code listing is given in Appendix 1 of the thesis <ref>[[Alexander Szabo]] ('''1984'''). ''[https://circle.ubc.ca/handle/2429/24780 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]</ref>.
=See also=
* [[Various Classifications#Benchmark|Benchmark]]
* [[Brute-Force]]
* [[Daly CP]]
* [[HiTech]]
* [[MAX (Gillogly)|MAX]]
* [[StarTech]]
* [[Type A Strategy]]
=Publications=
* [[James Gillogly]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0736043 The Technology Chess Program]''. [[Carnegie Mellon University]], CS-71-109, [http://repository.cmu.edu/cgi/viewcontent.cgi?article=2974&context=compsci pdf]
* [[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 3, pp. 145-163, reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]
* [[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]
* [[Alexander Szabo]] ('''1984'''). ''[https://circle.ubc.ca/handle/2429/24780 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=44 Tech's ICGA Tournaments]
* [https://github.com/PDP-10/its/tree/master/src/rg its/src/rg at master · PDP-10/its · GitHub] (Tech 2 source code) maintained by [https://github.com/larsbrinkhoff Lars Brinkhoff] and [https://github.com/eswenson1 Eric Swenson]
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
==Misc==
* [https://en.wikipedia.org/wiki/Tech Tech from Wikipedia]
* [https://en.wikipedia.org/wiki/Technology_%28disambiguation%29 Technology (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/Technology Technology from Wikipedia]
* [https://en.wikipedia.org/wiki/Portal:Technology Portal:Technology from Wikipedia]
* [https://en.wikipedia.org/wiki/Technological_singularity Technological singularity from Wikipedia]
* [https://en.wikipedia.org/wiki/Techno Techno from Wikipedia]
* [https://en.wikipedia.org/wiki/Technophilia Technophilia from Wikipedia]
* [https://en.wikipedia.org/wiki/Special:PrefixIndex/technology All pages with prefix technology from Wikipedia]
* [[Videos#JanKlare|Jan Klare's]] [[Videos#TheDorf|The Dorf]] - Technoid, [https://de.wikipedia.org/wiki/Museum_f%C3%BCr_Westf%C3%A4lische_Literatur_Haus_Nottbeck Kulturgut Haus Nottbeck], [https://en.wikipedia.org/wiki/Oelde Oelde], September 24, 2016, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=PFKrNZDOSRs|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[FILE:Technophilia.JPG|border|right|thumb|[https://en.wikipedia.org/wiki/Technophilia Technophilia] <ref>[https://en.wikipedia.org/wiki/Ceramic_art#Terracotta_.28artworks.29 Terracotta artwork] by [[Arts#GerhardHahn|Gerhard Hahn]], from the [https://www.lwl.org/industriemuseum/standorte/henrichshuette-hattingen/sonderausstellung/technophilia Technophilia] art exhibition at [https://www.lwl.org/industriemuseum/standorte/henrichshuette-hattingen/english Henrichshütte Ironworks - Museum of iron and steel], [https://en.wikipedia.org/wiki/Hattingen Hattingen], [https://en.wikipedia.org/wiki/North_Rhine-Westphalia North Rhine-Westphalia], [https://en.wikipedia.org/wiki/Germany Germany], part of [[Arts#IndustrialHeritageTrail|The Industrial Heritage Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], Photo by [[Gerd Isenberg]], October 01, 2016</ref> ]]
'''The Technology Chess Program''',<br/>
abbreviated '''Tech''', was one of the predecessors of modern chess programs, using a [[Claude Shannon|Shannon]] [[Type A Strategy]]. In [[Timeline#1970|1970]] Tech was written in [https://en.wikipedia.org/wiki/BLISS BLISS], a system programming language developed at [[Carnegie Mellon University]], and in 1977 ported to [[C]]. Primary Author was [[James Gillogly]] from Carnegie Mellon. [[Hans Berliner]] helped in developing the positional analysis ([[Evaluation|evaluation]]). The basic idea of the Tech program is due in large part to [[Allen Newell]]. In 1978 Gillogly wrote his Ph.D. Thesis about the performance analysis of Tech <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>. Tech competed at three [[ACM North American Computer Chess Championship|ACM North American Computer Chess Championships]], and was two times runner-up at [[ACM 1971]] and [[ACM 1972]].
=Quotes=
Quotes from ''The Technology Chess Program'' by [[James Gillogly]] <ref>[[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 3, pp. 145-163, reprinted ('''1988''') in [[Computer Chess Compendium]]</ref>.
==Abstract==
A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a [[Brute-Force|brute force search]] of the move tree with no [[Pruning|forward pruning]], using [[Material|material]] as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal. Because of the transparent structure, this program is proposed as a technological [[Various Classifications#Benchmark|benchmark]] for chess programs which will continue to improve as computer technology increases.
==Chess and Technology==
Until recently the main effort in chess programming has been to develop programs which selectively (and hopefully "intelligently") examine a small subset of the legal moves in any position. The surprising performance of the [[Daly CP|Varian minicomputer]] (programmed by [[Kenneth L. King|K. King]] and [[Chris Daly|C. Daly]]) in the [[ACM 1970|First Annual Computer Chess Championship]] (New York 1970), although due primarily to good luck in the pairings, led to increased speculation about the possibility of playing respectable chess with an unselective "brute force" program.
==Acknowledgments==
I am indebted to [[Hans Berliner]], World Correspondence Chess Champion, who developed the elegant techniques used in the positional analysis, and whose patient discussion helped to clarify many of the conceptional problems. The basic idea of the Technology Program is due in large part to [[Allen Newell]].
=Selected Games=
[[ACM 1971]], round 3, [[Coko|Coko 3]] - [[Tech]] <ref>[http://www.csvn.nl/index.php?option=com_docman&task=cat_view&gid=60&Itemid=26&lang=en PGN Download NACCC], [[CSVN]] site</ref>
<pre>
[Event "ACM 1971"]
[Site "Chicago USA"]
[Date "1971.08.04"]
[Round "3"]
[White "Coko 3"]
[Black "Tech"]
[Result "0-1"]
1.e4 e5 2.Nf3 Nc6 3.Bc4 Nf6 4.d3 d5 5.Bxd5 Nxd5 6.exd5 Qxd5 7.Nc3 Bb4 8.O-O Bxc3
9.bxc3 O-O 10.Ng5 Bf5 11.Rb1 f6 12.c4 Qc5 13.Nh3 Bxh3 14.Be3 Nd4 15.gxh3 Qc6 16.c3
Nf3+ 17.Kh1 Nd2+ 18.f3 Nxf1 19.Qxf1 f5 20.Rb5 f4 21.Rc5 Qe6 22.Bc1 c6 23.d4 Rae8
24.Rxe5 Qg6 25.Rxe8 Qxe8 26.Qf2 Qe6 27.Qf1 Rf5 28.h4 c5 29.d5 Qd6 30.Qh3 Qe5 31.Qf1
Qxc3 32.d6 Qd4 33.Qe2 Qxd6 34.Qe8+ Rf8 35.Qa4 Rf5 36.Qe8+ Rf8 37.Qa4 Qe6 38.Qb3 Qe2
39.h3 Rd8 40.Bxf4 Rd1+ 0-1
</pre>
<span id="Tech2"></span>
=Tech 2=
[[Massachusetts Institute of Technology|MIT]]-student [[Alan Baisley]], who already contributed as chess expert and [[Opening Book Authors|opening book-author]], implemented '''Tech 2''' in [[Assembly|assembly]] language on a [[PDP-10]] and gained about 25% in speed over the BLISS version on the same machine <ref>[[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]</ref>. ''Tech 2'' competed at the [[WCCC 1974|1st World Computer Chess Championship]] in Stockholm 1974 and became fifth with two wins and losses against [[Kaissa]] and [[Chess (Program)|Chess 4.0]] <ref>[https://www.game-ai-forum.org/icga-tournaments/program.php?id=44 Tech's ICGA Tournaments]</ref>, placed second at the [[ACM 1973]], and further played the [[ACM 1974]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=doc-431614f6cdeeb The eleventh ACM's North American Computer Chess Championship, Nashville, Tennessee October 26-28, 1980], [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3.1980_11th_ACM_NACCC/The_Eleventh_ACMs_North_American_Computer_Chess_Championship.1980.062303015.sm.pdf pdf] from [[The Computer History Museum]], see History of ACM events pg 11</ref> .
<span id="Tech3"></span>
=Tech 3=
'''Tech 3''' was an own program in the spirit of Tech by [[Alexander Szabo]] as subject of his Masters thesis at [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia] in 1984. Tech 3 performed a [[Brute-Force|brute force]] [[Alpha-Beta|alpha-beta search]] with [[Quiescence Search|quiescence]] and [[Iterative Deepening|iterative deepening]] with [[Aspiration Windows|aspiration windows]] , using a [[Transposition Table|transposition table]] with [[Zobrist Hashing|Zobrist hashing]], and still the rudimentary [[Evaluation|evaluation]] only based on [[Material|material balance]]. Tech 3 was written in [[Fortran]] and [[IBM 370]] [[Assembly]] to run on a [[Amdahl 470|Amdahl 470V/8]], the source code listing is given in Appendix 1 of the thesis <ref>[[Alexander Szabo]] ('''1984'''). ''[https://circle.ubc.ca/handle/2429/24780 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]</ref>.
=See also=
* [[Various Classifications#Benchmark|Benchmark]]
* [[Brute-Force]]
* [[Daly CP]]
* [[HiTech]]
* [[MAX (Gillogly)|MAX]]
* [[StarTech]]
* [[Type A Strategy]]
=Publications=
* [[James Gillogly]] ('''1971'''). ''[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=AD0736043 The Technology Chess Program]''. [[Carnegie Mellon University]], CS-71-109, [http://repository.cmu.edu/cgi/viewcontent.cgi?article=2974&context=compsci pdf]
* [[James Gillogly]] ('''1972'''). ''[http://www.sciencedirect.com/science/article/pii/0004370272900458 The Technology Chess Program]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 3, pp. 145-163, reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]
* [[James Gillogly]] ('''1978'''). ''Performance Analysis of the Technology Chess Program''. Ph.D. Thesis. Tech. Report CMU-CS-78-189, [[Carnegie Mellon University]], [http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/ftp/scan/CMU-CS-77-gillogly.pdf CMU-CS-77 pdf]
* [[Alexander Szabo]] ('''1984'''). ''[https://circle.ubc.ca/handle/2429/24780 Computer-Chess Tactics and Strategy]''. M.Sc. Thesis, [https://en.wikipedia.org/wiki/University_of_British_Columbia University of British Columbia]
=External Links=
==Chess Program==
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=44 Tech's ICGA Tournaments]
* [https://github.com/PDP-10/its/tree/master/src/rg its/src/rg at master · PDP-10/its · GitHub] (Tech 2 source code) maintained by [https://github.com/larsbrinkhoff Lars Brinkhoff] and [https://github.com/eswenson1 Eric Swenson]
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
==Misc==
* [https://en.wikipedia.org/wiki/Tech Tech from Wikipedia]
* [https://en.wikipedia.org/wiki/Technology_%28disambiguation%29 Technology (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/Technology Technology from Wikipedia]
* [https://en.wikipedia.org/wiki/Portal:Technology Portal:Technology from Wikipedia]
* [https://en.wikipedia.org/wiki/Technological_singularity Technological singularity from Wikipedia]
* [https://en.wikipedia.org/wiki/Techno Techno from Wikipedia]
* [https://en.wikipedia.org/wiki/Technophilia Technophilia from Wikipedia]
* [https://en.wikipedia.org/wiki/Special:PrefixIndex/technology All pages with prefix technology from Wikipedia]
* [[Videos#JanKlare|Jan Klare's]] [[Videos#TheDorf|The Dorf]] - Technoid, [https://de.wikipedia.org/wiki/Museum_f%C3%BCr_Westf%C3%A4lische_Literatur_Haus_Nottbeck Kulturgut Haus Nottbeck], [https://en.wikipedia.org/wiki/Oelde Oelde], September 24, 2016, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=PFKrNZDOSRs|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
