"On the Computability of Primitive Recursive Functions by Feedforward A" by Vladimir A. Kulyukin
 

Document Type

Article

Author ORCID Identifier

Vladimir A. Kulyukin https://orcid.org/0000-0002-8778-5175

Journal/Book Title/Conference

Mathematics

Volume

11

Issue

20

Publisher

MDPI AG

Publication Date

10-16-2023

First Page

1

Last Page

16

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

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 𝔑(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 (𝔑(z, 0), ... ,𝔑(z, m)).

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Downloads: 137
    • Abstract Views: 3
see details

Share

COinS