On the Computability of Primitive Recursive Functions by Feedforward Artificial Neural Networks

Vladimir A. Kulyukin ()
Additional contact information
Vladimir A. Kulyukin: Department of Computer Science, Utah State University, Logan, UT 84322, USA

Mathematics, 2023, vol. 11, issue 20, 1-16

Abstract: We show that, for a primitive recursive function h ( x , t ) , where x is a n -tuple of natural numbers and t is a natural number, there exists a feedforward artificial neural network N ( x , t ) , such that for any n -tuple of natural numbers z and a positive natural number m , the first m + 1 terms of the sequence { h ( z , t ) } are the same as the terms of the tuple ( N ( z , 0 ) , … , N ( z , m ) ) .

Keywords: computability theory; theory of recursive functions; artificial neural networks (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/20/4309/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/20/4309/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:20:p:4309-:d:1260757

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().