Results 61 to 70 of about 5,051 (115)
The Computability-Theoretic Content of Emergence [PDF]
In dealing with emergent phenomena, a common task is to identify useful descriptions of them in terms of the underlying atomic processes, and to extract enough computational content from these descriptions to enable predictions to be made. Generally, the
S. Barry Cooper
core
Journal of Time Series Analysis, Volume 47, Issue 3, Page 701-714, May 2026.ABSTRACTWith the advent of the Internet of Things, it is increasingly common to have large networks of sensors, where each sensor may collect different types of data, has limited local computing resources and the ability to transmit data to a central cloud. Detecting events that trigger changes in sensor data properties is a key concern.
Ziyang Yang +2 more
wiley +1 more source
Moving Sum Procedure for Multiple Change Point Detection in Large Factor Models
Journal of Time Series Analysis, Volume 47, Issue 3, Page 450-464, May 2026.ABSTRACT This paper proposes a moving sum methodology for detecting multiple change points in high‐dimensional time series under a factor model, where changes are attributed to those in loadings as well as emergence or disappearance of factors. We establish the asymptotic null distribution of the proposed test for family‐wise error control and show the
Matteo Barigozzi +2 more
wiley +1 more source
Reflections on Mathematical Economics in the Algorithmic Mode [PDF]
Non-standard analysis can be harnessed by the recursion theorist. But as a computable economist, the conundrums of the Löwenheim-Skolem theorem and the associated Skolem paradox, seem to pose insurmountable epistemological difficulties against the use of
K. Vela Velupillai
core
Entrywise transforms preserving matrix positivity and nonpositivity
Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.Abstract We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers. Compared to the classical work on entrywise preservers by Schoenberg and others, we completely resolve this ...
Dominique Guillot +3 more
wiley +1 more source
Some applications of logic to feasibility in higher types
, 2002 In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions.
Ignjatovic, Aleksandar, Sharma, Arun
core +1 more source
Brain electrical traits of logical validity. [PDF]
Sci Rep, 2021 Salto F +4 more
europepmc +1 more source
Uncomputability and Undecidability in Economic Theory [PDF]
Economic theory, game theory and mathematical statistics have all increasingly become algorithmic sciences. Computable Economics, Algorithmic Game Theory ([28]) and Algorithmic Statistics ([13]) are frontier research subjects.
K. Vela Velupillai
core
Some Useful Integral Representations for Information-Theoretic Analyses. [PDF]
Entropy (Basel), 2020 Merhav N, Sason I.
europepmc +1 more source