This paper takes issue with the recent themes of both the RO-MAN and the HRI conferences for their portrayal of a future human-robot society as inevitable. The focus is on discussing how such statements ultimately shape research. By treating a future human-robot society as a fait accompli, license is given for user studies to imagine any scenario they like, no matter whether it has any ecological relevance, and to emphasise the scenario design over actually creating robot abilities needed to fullfill the imagined role. Meanwhile, research that focusses on actual societal needs, without assuming that robots are a solution, is deprioritised, as is technical development, in particular with respect to abilities that are necessary to enable robots that function as social agents rather than a mere automation of tasks. A frame that simply assumes a robot future not only detracts from scientific advancement in favour of a techno-solutionism we ought to resist, it is also self-defeating as it risks stifling the research needed to bring it about. We should therefore reject attempts to frame and promote the field in terms of the inevitable social robot and instead focus on one that facilitate
Weak-to-strong generalization is a phenomenon in post-training whereby a strong student model, when finetuned solely with feedback from a weaker teacher, can not only surpass the teacher, but can improve upon its own capabilities. Recent work of Burns et al. (2023) demonstrated that this can occur in the setting of frontier language models, and subsequently there has been a flurry of both empirical work trying to exploit this phenomenon, as well as theoretical work attempting to understand it. In this work, we demonstrate that weak-to-strong generalization occurs in standard linear logistic regression, under mild distributional assumptions on the data. In fact, we show that this happens for most student-teacher pairs, suggesting that weak-to-strong generalization is in fact \emph{almost inevitable}, even in this basic setting. Notably, our setting does not require the student to be more expressive or have more model capacity in any way compared to the teacher, which runs contrary to the prevailing theoretical belief that a mismatch in model capacity is a central mechanism to weak-to-strong generalization.
Real-world backdoor attacks often require poisoned datasets to be stored and transmitted before being used to compromise deep learning systems. However, in the era of big data, the inevitable use of lossy compression poses a fundamental challenge to invisible backdoor attacks. We find that triggers embedded in RGB images often become ineffective after the images are lossily compressed into binary bitstreams (e.g., JPEG files) for storage and transmission. As a result, the poisoned data lose its malicious effect after compression, causing backdoor injection to fail. In this paper, we highlight the necessity of explicitly accounting for the lossy compression process in backdoor attacks. This requires attackers to ensure that the transmitted binary bitstreams preserve malicious trigger information, so that effective triggers can be recovered in the decompressed data. Building on the region-of-interest (ROI) coding mechanism in image compression, we propose two poisoning strategies tailored to inevitable lossy compression. First, we introduce Universal Attack Activation, a universal method that uses sample-specific ROI masks to reactivate trigger information in binary bitstreams for le
With the growing prevalence of always-on hardware such as smart glasses, body cameras, and home security systems, life-logging visual sensing is becoming inevitable, forming the backbone of persistent, always-on AI systems. Meanwhile, recent advances in proactive agents and world models signal a fundamental shift from episodic, prompt-driven tools to next-generation AI systems that continuously perceive and react to the physical world. Although life-logging video streams can substantially improve utility of these promising systems, they also introduce significant privacy risks by revealing sensitive information, such as behavioral patterns, emotional states, and social interactions, beyond what isolated images expose. If unresolved, these risks may undermine public trust and hinder the sustainable development of always-on AI technologies. Existing privacy protections are either attack-specific or incur substantial utility loss, and fail to consider the entire data exploitation pipeline. We therefore posit that the privacy-utility trade-off in life-logging video streams is a foundational challenge for next-generation AI systems that demands further investigation. We call for novel p
Large Language Models (LLMs) exhibit impressive linguistic competence but also produce inaccurate or fabricated outputs, often called ``hallucinations''. Engineering approaches usually regard hallucination as a defect to be minimized, while formal analyses have argued for its theoretical inevitability. Yet both perspectives remain incomplete when considering the conditions required for artificial general intelligence (AGI). This paper reframes ``hallucination'' as a manifestation of the generalization problem. Under the Closed World assumption, where training and test distributions are consistent, hallucinations may be mitigated. Under the Open World assumption, however, where the environment is unbounded, hallucinations become inevitable. This paper further develops a classification of hallucination, distinguishing cases that may be corrected from those that appear unavoidable under open-world conditions. On this basis, it suggests that ``hallucination'' should be approached not merely as an engineering defect but as a structural feature to be tolerated and made compatible with human intelligence.
Multimodal learning has seen remarkable progress, particularly with large-scale pre-training across various modalities. Most current approaches are built on the assumption of a deterministic one-to-one alignment between modalities. However, this oversimplifies real-world multimodal relationships, where their nature is inherently many-to-many. The many-to-many property, or multiplicity, is not a side-effect of noise or annotation error, but an inevitable outcome of intra-modal variability, representational asymmetry, and task-dependent ambiguity in multimodal tasks. We argue that multiplicity is a fundamental bottleneck that affects all stages of the multimodal learning pipeline: from data construction to model training and evaluation benchmarks. By formalizing its causes and consequences, we demonstrate how ignoring multiplicity leads to training uncertainty, unreliable evaluation, and degraded dataset quality. This position paper calls for new research directions on multimodal learning, including multiplicity-aware learning frameworks and dataset construction and evaluation protocols.
This study demonstrates the extent to which prominent debates about the future of AI are best understood as subjective, philosophical disagreements over the history and future of technological change rather than as objective, material disagreements over the technologies themselves. It focuses on the deep disagreements over whether artificial general intelligence (AGI) will prove transformative for human society; a question that is analytically prior to that of whether this transformative effect will help or harm humanity. The study begins by distinguishing two fundamental camps in this debate. The first of these can be identified as "transformationalists," who argue that continued AI development will inevitably have a profound effect on society. Opposed to them are "skeptics," a more eclectic group united by their disbelief that AI can or will live up to such high expectations. Each camp admits further "strong" and "weak" variants depending on their tolerance for epistemic risk. These stylized contrasts help to identify a set of fundamental questions that shape the camps' respective interpretations of the future of AI. Three questions in particular are focused on: the possibility o
Using large-scale citation data and a breakthrough metric, the study systematically evaluates the inevitability of scientific breakthroughs. We find that scientific breakthroughs emerge as multiple discoveries rather than singular events. Through analysis of over 40 million journal articles, we identify multiple discoveries as papers that independently displace the same reference using the Disruption Index (D-index), suggesting functional equivalence. Our findings support Merton's core argument that scientific discoveries arise from historical context rather than individual genius. The results reveal a long-tail distribution pattern of multiple discoveries across various datasets, challenging Merton's Poisson model while reinforcing the structural inevitability of scientific progress.
Hallucinations, a phenomenon where a language model (LM) generates nonfactual content, pose a significant challenge to the practical deployment of LMs. While many empirical methods have been proposed to mitigate hallucinations, recent studies established a computability-theoretic result showing that any LM will inevitably generate hallucinations on an infinite set of inputs, regardless of the quality and quantity of training datasets and the choice of the language model architecture and training and inference algorithms. Although the computability-theoretic result may seem pessimistic, its significance in practical viewpoints has remained unclear. This paper claims that those "innate" inevitability results from computability theory and diagonal argument, in principle, cannot explain practical issues of LLMs. We demonstrate this claim by presenting a positive theoretical result from a probabilistic perspective. Specifically, we prove that hallucinations can be made statistically negligible, provided that the quality and quantity of the training data are sufficient. Interestingly, our positive result coexists with the computability-theoretic result, implying that while hallucinations
In human-AI interactions, explanation is widely seen as necessary for enabling trust in AI systems. We argue that trust, however, may be a pre-requisite because explanation is sometimes impossible. We derive this result from a formalization of explanation as a search process through knowledge networks, where explainers must find paths between shared concepts and the concept to be explained, within finite time. Our model reveals that explanation can fail even under theoretically ideal conditions - when actors are rational, honest, motivated, can communicate perfectly, and possess overlapping knowledge. This is because successful explanation requires not just the existence of shared knowledge but also finding the connection path within time constraints, and it can therefore be rational to cease attempts at explanation before the shared knowledge is discovered. This result has important implications for human-AI interaction: as AI systems, particularly Large Language Models, become more sophisticated and able to generate superficially compelling but spurious explanations, humans may default to trust rather than demand genuine explanations. This creates risks of both misplaced trust an
Recent experiments suggest that low carrier density three-dimensional (3D) metals ZrTe$_5$ and HfTe$_5$ exhibit the 3D quantum Hall (QH) effect with Hall resistivity plateaus and a metal-insulator transition in strong magnetic fields. The conventional 3D QH theory requires a fixed period charge density wave (CDW), which is however not observed experimentally. We investigate alternative non-CDW mechanisms by considering a 3D metal in strong magnetic fields with electrons coupled to a boson (e.g., phonon) field. We show that the model exhibits inevitable first order phase transitions at jumps of the number of occupied Landau level bands, which do not involve CDW. These transitions may drive the system into a phase separation state with percolation transitions. We further show this can lead to Hall resistivity quasi-plateaus similar to that observed experimentally, and can provide a natural explanation for the metal-insulator transition.
Hopes are being widely expressed that C/2023 A3 could become a naked-eye object about the time of its perihelion passage in late 2024. However, based on its past and current performance, the comet is expected to disintegrate before reaching perihelion. Independent lines of evidence point to its forthcoming inevitable collapse. The first issue, which was recently called attention to by I. Ferrin, is this Oort cloud comet's failure to brighten at a heliocentric distance exceeding 2 AU, about 160 days preperihelion, accompanied by a sharp drop in the production of dust (Afρ). Apparent over a longer period of time, but largely ignored, has been the barycentric original semimajor axis inching toward negative numbers and the mean residual increasing after the light-curve anomaly, suggesting a fragmented nucleus whose motion is being affected a nongravitational acceleration; and an unusually narrow, teardrop dust tail with its peculiar orientation, implying copious emission of large grains far from the Sun but no microscopic material recently. This evidence suggests that the comet has entered an advanced phase of fragmentation, in which increasing numbers of dry, fractured refractory soli
Hallucination has been widely recognized to be a significant drawback for large language models (LLMs). There have been many works that attempt to reduce the extent of hallucination. These efforts have mostly been empirical so far, which cannot answer the fundamental question whether it can be completely eliminated. In this paper, we formalize the problem and show that it is impossible to eliminate hallucination in LLMs. Specifically, we define a formal world where hallucination is defined as inconsistencies between a computable LLM and a computable ground truth function. By employing results from learning theory, we show that LLMs cannot learn all the computable functions and will therefore inevitably hallucinate if used as general problem solvers. Since the formal world is a part of the real world which is much more complicated, hallucinations are also inevitable for real world LLMs. Furthermore, for real world LLMs constrained by provable time complexity, we describe the hallucination-prone tasks and empirically validate our claims. Finally, using the formal world framework, we discuss the possible mechanisms and efficacies of existing hallucination mitigators as well as the pra
The increasing reliance on digital platforms shapes how individuals understand the world, as recommendation systems direct users toward content "similar" to their existing preferences. While this process simplifies information retrieval, there is concern that it may foster insular communities, so-called echo chambers, reinforcing existing viewpoints and limiting exposure to alternatives. To investigate whether such polarization emerges from fundamental principles of recommendation systems, we propose a minimal model that represents users and content as points in a continuous space. Users iteratively move toward the median of locally recommended items, chosen by nearest-neighbor criteria, and we show mathematically that they naturally coalesce into distinct, stable clusters without any explicit ideological bias. Computational simulations confirm these findings and explore how population size, adaptation rates, content production probabilities, and noise levels modulate clustering speed and intensity. Our results suggest that similarity-based retrieval, even in simplified scenarios, drives fragmentation. While we do not claim all systems inevitably cause polarization, we highlight th
We look at consciousness through the lens of Theoretical Computer Science, a branch of mathematics that studies computation under resource limitations, distinguishing functions that are efficiently computable from those that are not. From this perspective, we develop a formal machine model for consciousness. The model is inspired by Alan Turing's simple yet powerful model of computation and Bernard Baars' theater model of consciousness. Though extremely simple, the model (1) aligns at a high level with many of the major scientific theories of human and animal consciousness, (2) provides explanations at a high level for many phenomena associated with consciousness, (3) gives insight into how a machine can have subjective consciousness, and (4) is clearly buildable. This combination supports our claim that machine consciousness is not only plausible but inevitable.
Populations do not only interact over time but also age over time. It is therefore common to model them as age-structured PDEs, where age is the space variable. Since the models also involve integrals over age, both in the birth process and in the interaction among species, they are in fact integro-partial differential equations (IPDEs) with positive states. To regulate the population densities to desired profiles, harvesting is used as input. But non-discriminating harvesting, where wanting to repress one species will inevitably repress the other species as well, the positivity restriction on the input (no insertion of population), and the multiplicative nature of harvesting, makes control challenging even for ODE versions of such dynamics, let alone for their IPDE versions on an infinite-dimensional nonnegative state space. We introduce a design for a benchmark version of such a problem: a two-population predator-prey setup. The model is equivalent to two coupled ordinary differential equations (ODEs), actuated by harvesting which must not drop below zero, and strongly disturbed by two autonomous but exponentially stable integral delay equations (IDEs). We develop two control des
Here, we quantitatively estimate the impact of the inevitable Si surface passivation prior to III-V/Si hetero-epitaxy on the surface energy of the Si initial substrate, and explore its consequences for the description of wetting properties. Density Functional Theory is used to determine absolute surface energies of P- and Ga-passivated Si surfaces and their dependencies with the chemical potential. Especially, we show that, while a ~90 meV/$Å^2$ surface energy is usually considered for the nude Si surface, surface passivation by Ga- or P- atoms leads to a strong stabilization of the surface, with a surface energy in the [50-75 meV/$Å^2$] range. The all-ab initio analysis of the wetting properties indicate that a complete wetting situation would become possible only if the initial passivated Si surface could be destabilized by at least 15 meV/$Å^2$ or if the III-V (001) surface could be stabilized by the same amount.
The widespread adoption of TLS 1.3 and QUIC has rendered payload content invisible, shifting traffic analysis toward side-channel features. However, rigorous justification for why side-channel leakage is inevitable in encrypted communications has been lacking. This paper establishes a strict foundation from information theory by constructing a formal model \(Σ=(Γ,Ω)\), where \(Γ=(A,Π,Φ,N)\) describes the causal chain of application generation, protocol encapsulation, encryption transformation, and network transmission, while \(Ω\) characterizes observation capabilities. Based on composite channel structure, data processing inequality, and Lipschitz statistics propagation, we propose and prove the Side-Channel Existence Theorem: for distinguishable semantic pairs, under conditions including mapping non-degeneracy (\(\mathbb{E}[d(z_P,z_N)\mid X]\le C\)), protocol-layer distinguishability (expectation difference \(\ge\barΔ\)), Lipschitz continuity, observation non-degeneracy (\(ρ>0\)), and propagation condition (\(C<\barΔ/2L_\varphi\)), the mutual information \(I(X;Y)\) is strictly positive with explicit lower bound. The corollary shows that in efficiency-prioritized systems, le
We study functions satisfying the composition law $F(xy)+F(x/y)=P(F(x),F(y))$ with a symmetric polynomial combiner $P$. We prove that symmetry together with a quadratic degree bound on $P$ forces a composition law of d'Alembert type. We establish a degree mismatch exclusion criterion showing that symmetric polynomial combiners with $\mbox{deg} P(u,v) \ge 3$ do not admit nonconstant continuous solutions, provided the leading term does not cancel (Theorem 3.1.). For continuous nonconstant functions $F:\mathbb{R}_{>0}\to\mathbb{R}$ with $F(1)=0$ satisfying the composition law with a symmetric polynomial $P$ of degree at most two, the combiner is necessarily of the form $P(u,v)=2u+2v+c\,uv$, $c\in\mathbb{R}$ (Theorem 3.3.). The equation reduces in logarithmic coordinates to the classical d'Alembert functional equation. For $c eq 0$, one obtains hyperbolic or trigonometric branches, while $c=0$ yields the squared-logarithm family. Under the cost-function assumptions $F\ge 0$ and convexity, only the hyperbolic branch with $c>0$ remains. A unit log-curvature calibration selects the canonical value $c=2$, which yields the canonical reciprocal cost $F(x)=\tfrac12(x+x^{-1})-1$. For $c
We reveal that a fundamental minimal length naturally replaces the Schwarzschild singularity with future infinity, formalizing the ``asymptotic throat'' as a geometric inevitability. This scheme avoids the topology changes, multiple horizons, and universe towers characteristic of existing regular black hole models. We establish a general regularization framework, construct explicit examples with their physical sources, and show that the surface gravity and Hawking temperature remain unaltered. The asymptotic throat thus provides a pristine classical bedrock for future quantum gravity investigations.