Back-reference Analogy within Artificial Neural Networks Implementation

09 November 2026, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

We are to address our past approach to tackling back-reference problem which is known to be NP-hard and, thus, impractical in general, however, the applicable and practical approach is required in order to make the search possible within the defined time frame, on that account we present our ‘in-deep’ concept which can be applied in the implementation of artificial neural networks (ANNs), this approach gives us the delay function which can be successfully used in the hypothetical networks, where the immediate transition between neural nodes is to be made delayed according to the structure and maybe even nature, we will further discuss how it can be vital for the newly presented ANNs

Keywords

back-reference
algorithm
local search
artificial neural networks
model

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.