Skip to main content
Erschienen in: International Journal of Machine Learning and Cybernetics 1/2016

01.02.2016 | Original Article

Proximity reasoning for discoveries

verfasst von: Boris Stilman

Erschienen in: International Journal of Machine Learning and Cybernetics | Ausgabe 1/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We investigate structure of the Primary Language of the human brain as introduced by J. von Neumann in 1957. Two components have been investigated, the algorithm optimizing warfighting, Linguistic Geometry (LG), and the algorithm for inventing new algorithms, the Algorithm of Discovery. The latter is based on multiple thought experiments, which manifest themselves via mental visual streams (“mental movies”). It appears that those streams are the only interface available for this brain phenomenon. The visual streams can run concurrently and can exchange information between each other. The streams may initiate additional thought experiments, program them, and execute them in due course. The visual streams are focused employing the algorithm of “a child playing a construction set” that includes a visual model, a construction set and the Ghost. It appears that all the discoveries require optimization hidden in the algorithm, object or process to be discovered. Natural and artificial objects are usually optimized one way or another. Thus optimization should be a major component of the Algorithm of Discovery. As an algorithm utilized by humans since ancient times it could not use any kind of differential calculus for such optimization. This paper is the first attempt to reveal the nature of this optimization component that is named proximity reasoning. Our findings about proximity reasoning are tested on the thought experiments for development of two algorithms in LG: function next for the Grammars of Shortest Trajectories and the No-Search Approach based on the State Space Chart. While those experiments were already investigated in several papers this paper takes yet another look at them in order to revealing the nature of proximity reasoning.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Literatur
1.
Zurück zum Zitat Botvinnik M (1970) Chess, computers, and long-range planning. Springer, New York CrossRef Botvinnik M (1970) Chess, computers, and long-range planning. Springer, New York CrossRef
2.
Zurück zum Zitat Botvinnik M (1972) Blok-skema algorithma igry v shahmaty (in Russian: a flow-chart of the algorithm for playing chess), Sov Radio, Moscow Botvinnik M (1972) Blok-skema algorithma igry v shahmaty (in Russian: a flow-chart of the algorithm for playing chess), Sov Radio, Moscow
3.
Zurück zum Zitat Botvinnik M (1984) Computers in chess: solving inexact search problems. Springer, New YorkMATHCrossRef Botvinnik M (1984) Computers in chess: solving inexact search problems. Springer, New YorkMATHCrossRef
4.
Zurück zum Zitat Kott A, McEneaney W (eds) (2007) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman & Hall/CRC, Boca Raton, FL Kott A, McEneaney W (eds) (2007) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman & Hall/CRC, Boca Raton, FL
5.
Zurück zum Zitat Miller A (1996) Insights of genius: imagery and creativity in science and art. Springer, New YorkMATHCrossRef Miller A (1996) Insights of genius: imagery and creativity in science and art. Springer, New YorkMATHCrossRef
6.
Zurück zum Zitat Stilman B (1975) Formation of the set of trajectory bundles, Appendix 1 to the book: on the cybernetic goal of games. In: Botvinnik MM Soviet Radio, Moscow (in Russian), pp 70–77 Stilman B (1975) Formation of the set of trajectory bundles, Appendix 1 to the book: on the cybernetic goal of games. In: Botvinnik MM Soviet Radio, Moscow (in Russian), pp 70–77
7.
Zurück zum Zitat Stilman B Ierarhia formalnikh grammatik dla reshenia prebornikh zadach (Hierachy of formal grammars for solving search problems), Technical report, VNIIE, Moscow (in Russian) p 105 Stilman B Ierarhia formalnikh grammatik dla reshenia prebornikh zadach (Hierachy of formal grammars for solving search problems), Technical report, VNIIE, Moscow (in Russian) p 105
8.
Zurück zum Zitat Stilman B (1993) A formal language for hierarchical systems control. Int J Lang Des 1(4):333–356 Stilman B (1993) A formal language for hierarchical systems control. Int J Lang Des 1(4):333–356
11.
Zurück zum Zitat Stilman B (1994) Linguistic geometry for control systems design. Int J Comput Appl 1(2):89–110MathSciNet Stilman B (1994) Linguistic geometry for control systems design. Int J Comput Appl 1(2):89–110MathSciNet
13.
Zurück zum Zitat Stilman B (1996) Linguistic geometry tools generate optimal solutions. In: Proceedings of the 4th international conference on conceptual structures, ICCS’96, pp 75–99, 19–22 Aug 1996, Sydney, Australia Stilman B (1996) Linguistic geometry tools generate optimal solutions. In: Proceedings of the 4th international conference on conceptual structures, ICCS’96, pp 75–99, 19–22 Aug 1996, Sydney, Australia
14.
Zurück zum Zitat Stilman B (1997) Managing search complexity in linguistic geometry. IEEE Trans Syst Man Cybern 27(6):978–998CrossRef Stilman B (1997) Managing search complexity in linguistic geometry. IEEE Trans Syst Man Cybern 27(6):978–998CrossRef
15.
Zurück zum Zitat Stilman B (1997) Network languages for concurrent multi-agent systems. Int J Comput Math Appl 34(1):103–136MATHCrossRef Stilman B (1997) Network languages for concurrent multi-agent systems. Int J Comput Math Appl 34(1):103–136MATHCrossRef
16.
Zurück zum Zitat Stilman B (2000) Linguistic geometry: from search to construction. Kluwer Academic Publishers (now Springer), pp 416 Stilman B (2000) Linguistic geometry: from search to construction. Kluwer Academic Publishers (now Springer), pp 416
17.
Zurück zum Zitat Stilman B (2011) Linguistic geometry and evolution of intelligence. ISAST Trans Comput Intell Syst 3(2):23–37 Stilman B (2011) Linguistic geometry and evolution of intelligence. ISAST Trans Comput Intell Syst 3(2):23–37
18.
Zurück zum Zitat Stilman B (2011) Thought experiments in linguistic geometry. In: Proceedings of the 3rd international conference on advanced cognitive technologies and applications, COGNITIVE’2011, Rome, Italy, 25–30 Sep 2011, pp 77–83 Stilman B (2011) Thought experiments in linguistic geometry. In: Proceedings of the 3rd international conference on advanced cognitive technologies and applications, COGNITIVE’2011, Rome, Italy, 25–30 Sep 2011, pp 77–83
23.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2000) Winning strategies for robotic wars: defense applications of linguistic geometry. Artif Life Robot 4(3):148–155 Stilman B, Yakhnis V, Umanskiy O (2000) Winning strategies for robotic wars: defense applications of linguistic geometry. Artif Life Robot 4(3):148–155
24.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2002) Knowledge acquisition and strategy generation with LG wargaming tools. Int J Comp Intell Appl 2(4):385–409CrossRef Stilman B, Yakhnis V, Umanskiy O (2002) Knowledge acquisition and strategy generation with LG wargaming tools. Int J Comp Intell Appl 2(4):385–409CrossRef
25.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2007) Chapter 3.3. Strategies in large scale problems. In: Kott A, McEneaney W (eds) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman & Hall/CRC, Boca Raton, FL, pp 251–285 Stilman B, Yakhnis V, Umanskiy O (2007) Chapter 3.3. Strategies in large scale problems. In: Kott A, McEneaney W (eds) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman & Hall/CRC, Boca Raton, FL, pp 251–285
26.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2010) Linguistic geometry: the age of maturity. J Adv Comput Intell Intell Inform 14(6):684–699 Stilman B, Yakhnis V, Umanskiy O (2010) Linguistic geometry: the age of maturity. J Adv Comput Intell Intell Inform 14(6):684–699
27.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2010) Revisiting history with linguistic geometry. ISAST Trans Comput Intell Syst 2(2):22–38 Stilman B, Yakhnis V, Umanskiy O (2010) Revisiting history with linguistic geometry. ISAST Trans Comput Intell Syst 2(2):22–38
28.
Zurück zum Zitat Stilman B, Yakhnis V, Umanskiy O (2011) The primary language of ancient battles. Int J Mach Learn Cybern 2(3):157–176CrossRef Stilman B, Yakhnis V, Umanskiy O (2011) The primary language of ancient battles. Int J Mach Learn Cybern 2(3):157–176CrossRef
29.
Zurück zum Zitat Volchenkov N (1979) Interpretator beskontekstnikh upravliaemikh parametricheskikh programmnikh grammatik (Interpreter of Context-free Controlled Programmed Grammars with Parameters) in Voprosy Kibernetiky: Intellektualnie banky dannikh (Proceedings on cybernetics: intelligent data banks), pp 147–157, USSR Academy of Sciences, Science Board on Complex Problem Cybernetics, 1979 (in Russian) Volchenkov N (1979) Interpretator beskontekstnikh upravliaemikh parametricheskikh programmnikh grammatik (Interpreter of Context-free Controlled Programmed Grammars with Parameters) in Voprosy Kibernetiky: Intellektualnie banky dannikh (Proceedings on cybernetics: intelligent data banks), pp 147–157, USSR Academy of Sciences, Science Board on Complex Problem Cybernetics, 1979 (in Russian)
30.
Zurück zum Zitat Von Neumann J (1958) The computer and the brain. U Press, YaleMATH Von Neumann J (1958) The computer and the brain. U Press, YaleMATH
Metadaten
Titel
Proximity reasoning for discoveries
verfasst von
Boris Stilman
Publikationsdatum
01.02.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Machine Learning and Cybernetics / Ausgabe 1/2016
Print ISSN: 1868-8071
Elektronische ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-014-0249-x

Weitere Artikel der Ausgabe 1/2016

International Journal of Machine Learning and Cybernetics 1/2016 Zur Ausgabe

Neuer Inhalt