Results 31 to 40 of about 249,549 (273)
Approximation systems for functions in topological and in metric spaces [PDF]
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names.
Skordev, Dimiter
core +2 more sources
A foundation for real recursive function theory
The class of recursive real functions, REC\((\mathbb R)\), is defined as the smallest set containing the constant functions 0, 1, and \(-1\), the projection functions, and closed under composition, aggregation, differential recursion, and the lim sup operator.
José Félix Costa +2 more
openaire +2 more sources
Sub-computable Boundedness Randomness [PDF]
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE ...
Buss, Sam +2 more
core +1 more source
A Hypergraph Approach for Estimating Growth Mechanisms of Complex Networks
Temporal datasets that describe complex interactions between individuals over time are increasingly common in various domains. Conventional graph representations of such datasets may lead to information loss since higher-order relationships between more ...
Masaaki Inoue +2 more
doaj +1 more source
Study of algorithmic approaches to digital signal filtering and the influence of input quantization on output accuracy [PDF]
This article explores the design and application of intelligent control systems tailored for industrial and production environments, with a particular focus on integrating advanced digital filtering and noise reduction strategies.
Shermuradova Malika +4 more
doaj +1 more source
Reservoir computing refers to a computational framework based on recurrent neural networks that can process time-series data. In an echo state network (ESN), which is a type of reservoir computing framework, the reservoir consists of a recursive network ...
Hideki Ogawa, Yasutake Takahashi
doaj +1 more source
Arithmetic complexity via effective names for random sequences [PDF]
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e.
Arslanov M. M. +6 more
core +1 more source
Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iraj Kalantari, Lawrence Welch
openaire +2 more sources
Holant Problems for Regular Graphs with Complex Edge Functions [PDF]
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which ...
Cai, Jin-Yi, Kowalczyk, Michael
core +5 more sources
Directional Forgetting for Stable Co-Adaptation in Myoelectric Control
Conventional myoelectric controllers provide a mapping between electromyographic signals and prosthetic functions. However, due to a number of instabilities continuously challenging this process, an initial mapping may require an extended calibration ...
Dennis Yeung +2 more
doaj +1 more source

