Skip to main content

Advertisement

Log in

Proximity reasoning for discoveries

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

References

  1. Botvinnik M (1970) Chess, computers, and long-range planning. Springer, New York

    Book  Google Scholar 

  2. Botvinnik M (1972) Blok-skema algorithma igry v shahmaty (in Russian: a flow-chart of the algorithm for playing chess), Sov Radio, Moscow

  3. Botvinnik M (1984) Computers in chess: solving inexact search problems. Springer, New York

    Book  MATH  Google Scholar 

  4. Kott A, McEneaney W (eds) (2007) Adversarial reasoning: computational approaches to reading the opponent’s mind. Chapman & Hall/CRC, Boca Raton, FL

    Google Scholar 

  5. Miller A (1996) Insights of genius: imagery and creativity in science and art. Springer, New York

    Book  MATH  Google Scholar 

  6. 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. 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. Stilman B (1993) A formal language for hierarchical systems control. Int J Lang Des 1(4):333–356

    Google Scholar 

  9. Stilman B (1993) A linguistic approach to geometric reasoning. Int J Comput Math Appl 26(7):29–58

    Article  MATH  MathSciNet  Google Scholar 

  10. Stilman B (1993) Network languages for complex systems. Int J Comput Math Appl 26(8):51–80

    Article  MATH  MathSciNet  Google Scholar 

  11. Stilman B (1994) Linguistic geometry for control systems design. Int J Comput Appl 1(2):89–110

    MathSciNet  Google Scholar 

  12. Stilman B (1994) Translations of network languages. Int J Comput Math Appl 27(2):65–98

    Article  MATH  MathSciNet  Google Scholar 

  13. 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. Stilman B (1997) Managing search complexity in linguistic geometry. IEEE Trans Syst Man Cybern 27(6):978–998

    Article  Google Scholar 

  15. Stilman B (1997) Network languages for concurrent multi-agent systems. Int J Comput Math Appl 34(1):103–136

    Article  MATH  Google Scholar 

  16. Stilman B (2000) Linguistic geometry: from search to construction. Kluwer Academic Publishers (now Springer), pp 416

  17. Stilman B (2011) Linguistic geometry and evolution of intelligence. ISAST Trans Comput Intell Syst 3(2):23–37

    Google Scholar 

  18. 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

  19. Stilman B (2013) Discovering the discovery of linguistic geometry. Int J Mach Learn Cybern 4(6):575–594. doi:10.1007/s13042-012-0114-8

    Article  Google Scholar 

  20. Stilman B (2012) Discovering the discovery of the no-search approach. Int J Mach Learn Cybern. doi:10.1007/s13042-012-0127-3

    Google Scholar 

  21. Stilman B (2012) Discovering the discovery of the hierarchy of formal languages. Int J Mach Learn Cybern. doi:10.1007/s13042-012-0146-0

    Google Scholar 

  22. Stilman B (2013) Visual reasoning for discoveries. Int J Mach Learn Cybern. doi:10.1007/s13042-013-0189-x

    Google Scholar 

  23. Stilman B, Yakhnis V, Umanskiy O (2000) Winning strategies for robotic wars: defense applications of linguistic geometry. Artif Life Robot 4(3):148–155

    Google Scholar 

  24. Stilman B, Yakhnis V, Umanskiy O (2002) Knowledge acquisition and strategy generation with LG wargaming tools. Int J Comp Intell Appl 2(4):385–409

    Article  Google Scholar 

  25. 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. Stilman B, Yakhnis V, Umanskiy O (2010) Linguistic geometry: the age of maturity. J Adv Comput Intell Intell Inform 14(6):684–699

    Google Scholar 

  27. Stilman B, Yakhnis V, Umanskiy O (2010) Revisiting history with linguistic geometry. ISAST Trans Comput Intell Syst 2(2):22–38

    Google Scholar 

  28. Stilman B, Yakhnis V, Umanskiy O (2011) The primary language of ancient battles. Int J Mach Learn Cybern 2(3):157–176

    Article  Google Scholar 

  29. 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. Von Neumann J (1958) The computer and the brain. U Press, Yale

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Boris Stilman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stilman, B. Proximity reasoning for discoveries. Int. J. Mach. Learn. & Cyber. 7, 53–84 (2016). https://doi.org/10.1007/s13042-014-0249-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13042-014-0249-x

Keywords

Navigation