Affiliation:
1. Sobolev Institute of Mathematics, Academician Koptyug Ave., 4, 630090 Novosibirsk, Russia
Abstract
A lot of libraries for neural networks are written for Turing-complete programming languages such as Python, C++, PHP, and Java. However, at the moment, there are no suitable libraries implemented for a p-complete logical programming language L. This paper investigates the issues of polynomial-computable representation neural networks for this language, where the basic elements are hereditarily finite list elements, and programs are defined using special terms and formulas of mathematical logic. Such a representation has been shown to exist for multilayer feedforward fully connected neural networks with sigmoidal activation functions. To prove this fact, special p-iterative terms are constructed that simulate the operation of a neural network. This result plays an important role in the application of the p-complete logical programming language L to artificial intelligence algorithms.
Funder
Sobolev Institute of Mathematics
Subject
Psychiatry and Mental health
Reference21 articles.
1. Semantic programming;Ershov;Inf. Process.,1986
2. Ershov, Y.L. (1996). Definability and Computability, Springer.
3. Programming Paradigms, Turing Completeness and Computational Thinking;Michaelson;Art Sci. Eng. Program.,2020
4. Conditional terms in semantic programming;Goncharov;Sib. Math. J.,2017
5. On the complexity of formulas in semantic programming;Ospichev;Semr,2018
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献