Results 41 to 50 of about 5,051 (115)
The Lost Melody Phenomenon [PDF]
, 2015 A typical phenomenon for machine models of transfinite computations is the existence of so-called lost melodies, i.e. real numbers $x$ such that the characteristic function of the set $\{x\}$ is computable while $x$ itself is not (a real having the first
Carl, Merlin
core
The Rice-Shapiro theorem in Computable Topology
, 2017 We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces.
Korovina, Margarita, Kudinov, Oleg
core +1 more source
Continual decision‐making dynamics across biological organisms
Biological Reviews, Volume 101, Issue 3, Page 1059-1072, June 2026.ABSTRACT Decision‐making is a central function of adaptive behaviour in biological agents. However, strategies for adaptive decision‐making can vary substantially across species. Here, we aim to extend the comparative scope of decision‐making analyses to phylogenetically diverse organisms.
Liberty Severs, Qiuran Wang
wiley +1 more source
Computability and Algorithmic Complexity in Economics [PDF]
This is an outline of the origins and development of the way computability theory and algorithmic complexity theory were incorporated into economic and finance theories.
K. Vela Velupillai, Stefano Zambelli
core
A bounded jump for the bounded Turing degrees
, 2010 We define the bounded jump of A by A^b = {x | Exists i 1 we have X
Anderson, Bernard A., Csima, Barbara F.
core +2 more sources
Algebraic Observability of Rational Systems
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 2, June 2026.ABSTRACT For nonlinear systems, the concept of observability is defined by the indistinguishability of states. In the practical implementation, the distinguishing of states is carried out via the observability map consisting of Lie derivatives. This approach is comparatively difficult for general nonlinear systems.
Klaus Röbenack, Daniel Gerbet
wiley +1 more source
A Computable Economist’s Perspective on Computational Complexity [PDF]
, 2007 A computable economist's view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role.
Vela Velupillai, K.
core
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Arrow's Theorem, countably many agents, and more visible invisible dictators [PDF]
For infinite societies, Fishburn (1970), Kirman and Sondermann (1972), and Armstrong (1980) gave a nonconstructive proof of the existence of a social welfare function satisfying Arrowfs conditions (Unanimity, Independence, and Nondictatorship).
H. Reiju Mihara
core
Countable Basis for Free Electromagnetic Fields
Annalen der Physik, Volume 538, Issue 5, May 2026.ABSTRACT Polychromatic electromagnetic fields are expanded as integrals over monochromatic fields, such as plane waves, multipolar fields, or Bessel beams. However, monochromatic fields do not belong to the Hilbert space of free Maxwell fields, since their norms diverge.
Ivan Fernandez‐Corbaton
wiley +1 more source