Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Select your language


Significant combinatorial space and artificial intelligence

Tymofijeva N.1
1 International Scientific and Training Center for Information Technologies and Systems of National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine
TymNad@gmail.com

Full text (PDF)

UDC: 519.816
Publication Language: Ukrainian
Stuc. intelekt. 2015; 20(1-2):180-189

Abstract: In the article are described a significant combinatorial spaces that exist in two states: tranquility (convolute), which is given by the sign, and dynamics (deployed), which deployed from convolute. The points of these spaces are combinatorial configurations different types. It is shown that the axioms introduced fair for biological, information, broadcasting spaces that take place in artificial intelligence.

Keywords: significant combinatorial spaces, combinatorial configuration, physical spaces, recursion combinatorial operators.

References:

  1. Sergienko I. V. and Каspthitzkaja M. F. Models and methods of computer solutions of combinatorialoptimization problems, Kyiv, Ukraine, 1981, Sciences Dumka, 281 p. (In Russian).
  2. Burduk V.J. The discrete metric space. – Dnepropetrovsk, DNU, 1982. – 99 p.
  3. Bichara Alessandro. Ruled sets imbedden in a combinatorial space // Atti Semin. Mat. e fis. Univ.Modena. –1982. – 31, № 2. – P. 213–218.
  4. Golenko-Ginzburg Dvitri. Metricsin the permutation space//Appl. Math. Lett. – 1991. – 4, № 2. –P. 5–7.
  5. Brown T.C. Affine and combinatorial binary-spaces // “J. Combin Theory, 1985, A39, №1. P. 25–34.
  6. Soskov I. Communication with simple computability and recurrent in functional combinatorial spaces //Mat. programming theory: The collection of research works. – Novosibirsk, 1985. – С. 4–11.
  7. D. Skordev. Recursion theory on iterative combinatory spaces // Bull. Acad. Polon. Sci., Sér Sci. Math.Astronom. Phys. – 1976. 24, № 1. – P. 23-31.
  8. Stojan Y.G. A displaying of combinatorial sets in Euclidean space. – Kharkiv, 1982. – 33 с. – (PreprintUkrainian Academy of Sciences. Institute of Problems. engineering; 173);
  9. Tymofijeva N.K. Theoretical-Numerical Methods Used to Solve Combinatorial Optimization Problems,Тне Thesis for Doctor's Degree in Technical Sciences on Speciality 01.05.02 – Modelling andNumerical Methods Mathema-tical, Kyiv, Ukraine, 2007, V.M. Glushkov Institute of Cybernetics ofNational Academy of Sciences of Ukraine, 32 p. (In Ukrainian).
  10. Tymofijeva N.K. Recurrent-periodic method for generating combinatorial configurations //Combinatorial configurations and applications: Materials Tenth Intercollegiate scientific workshop (15-16 October 2010). – Kirovograd: Kirovog. tehnycheskyy Univ. – 2010. – P. 138–141.
  11. The World of Mathematics: в 40 v. V 1: Fernando Korbalan. Golden Section. Mathematical language ofbeauty / Trans. from English. – М.: De Аgostini, 2014. – 160 p.
  12. Davidov І.V. Description of linear spaces using combinatorial configurations // Combinatorialconfigurations and applications: Materials Tenth Intercollegiate scientific workshop (13-14 April 2012).– Kirovograd: Kirovog. tehnycheskyy Univ. – 2012. – P. 45–49.

View full text (PDF)