中文
相关论文

相关论文: Resource Bounded Immunity and Simplicity

200 篇论文

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

数论 · 数学 2015-01-28 Stijn S. C. Hanson

We present new information-theoretic generalization guarantees through the a novel construction of the "neighboring-hypothesis" matrix and a new family of stability notions termed sample-conditioned hypothesis (SCH) stability. Our approach…

机器学习 · 统计学 2023-11-01 Ziqiao Wang , Yongyi Mao

Biological and artificial networks routinely make reliable distinctions between similar inputs, and the rules for making these distinctions are learned. In some ways, self/nonself discrimination in the immune system is similar, being both…

We live within an increasingly technological, information-laden environment for the first time in human evolution.This subjects us, and will continue to subject us in an accelerating fashion, to an unremitting exposure to meaningful…

种群与进化 · 定量生物学 2013-06-13 Marios Kyriazis

A system's apparent simplicity depends on whether it is represented classically or quantally. This is not so surprising, as classical and quantum physics are descriptive frameworks built on different assumptions that capture, emphasize, and…

量子物理 · 物理学 2016-03-01 Cina Aghamohammadi , John R. Mahoney , James P. Crutchfield

The dynamics of strongly immunizing childhood infections is still not well understood. Although reports of successful modeling of several incidence data records can be found in the literature, the key determinants of the observed temporal…

种群与进化 · 定量生物学 2012-10-09 Ganna Rozhnova , Ana Nunes

We give an overview of the fundamental definitions and results concerning hypersurface singularities, defined by convergent power series over an arbitrary real valued field. This approach combines, on the one hand, the classical case of…

代数几何 · 数学 2026-02-18 Gert-Martin Greuel

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

逻辑 · 数学 2016-12-20 Dmytro Taranovsky

Despite the obvious advantage of simple life forms capable of fast replication, different levels of cognitive complexity have been achieved by living systems in terms of their potential to cope with environmental uncertainty. Against the…

种群与进化 · 定量生物学 2017-10-18 Luís F Seoane , Ricard Solé

A key question in biological systems is whether genetic diversity persists in the long run under evolutionary competition or whether a single dominant genotype emerges. Classic work by Kalmus in 1945 has established that even in simple…

种群与进化 · 定量生物学 2015-10-23 Ruta Mehta , Ioannis Panageas , Georgios Piliouras , Sadra Yazdanbod

We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…

逻辑 · 数学 2021-04-19 Itay Kaplan , Nicholas Ramsey , Saharon Shelah

The most popular stability notion in games should be Nash equilibrium under the rationality of players who maximize their own payoff individually. In contrast, in many scenarios, players can be (partly) irrational with some unpredictable…

计算机科学与博弈论 · 计算机科学 2017-03-10 Ching-Hua Yu

General criterion for best efficiency of the interaction of a complex system with an ever-changing environment is derived. Its exclusive property, set by boundedness, is that the highly non-trivial interplay between parameters that…

适应与自组织系统 · 物理学 2014-03-12 Maria K. Koleva

Recently, much work has been carried out to study simplicial interpretations of modal logic. While notions of (distributed) knowledge have been well investigated in this context, it has been open how to model belief in simplicial models. We…

计算机科学中的逻辑 · 计算机科学 2026-01-13 Christian Cachin , David Lehnherr , Thomas Studer

This paper resolves two open problems from a recent paper, arXiv:2403.16981, concerning the sample complexity of distributed simple binary hypothesis testing under information constraints. The first open problem asks whether interaction…

信息论 · 计算机科学 2025-06-18 Hadi Kazemi , Ankit Pensia , Varun Jog

If an infinite non-periodic word is uniformly recurrent or is of bounded repetition, then the limit of its periodicity complexity is infinity. Moreover, there are uniformly recurrent words with the periodicity complexity arbitrarily high at…

形式语言与自动机理论 · 计算机科学 2019-12-18 Štěpán Holub

In a previous paper the authors argued the case for incorporating ideas from innate immunity into articficial immune systems (AISs) and presented an outline for a conceptual framework for such systems. A number of key general properties…

人工智能 · 计算机科学 2016-11-17 Jamie Twycross , Uwe Aickelin

Conditions for Bayesian posterior robustness have been examined in recent literature. However, many of the proofs seem to be long and complicated. In this paper, we first summarize some basic lemmas that have been applied implicitly or…

统计理论 · 数学 2023-11-06 Yasuyuki Hamura

We define a new notion of compressibility of a set of numbers through the dynamics of a polynomial function. We provide approaches to solve the problem by reducing it to the multi-criteria traveling salesman problem through a series of…

计算复杂性 · 计算机科学 2013-02-05 Karthik S. Gurumoorthy

We provide a novel semantics for belief using simplicial complexes. In our framework, belief satisfies the \textsf{KD45} axioms and rules as well as the ``knowledge implies belief'' axiom ($K\phi \lthen B\phi$); in addition, we adopt the…

计算机科学中的逻辑 · 计算机科学 2025-12-17 Philip Sink , Adam Bjorndahl