Zobrazeno 1 - 10
of 4 896
pro vyhledávání: '"computer science - symbolic computation"'
Autor:
Ibrahim, Alaa, Salvy, Bruno
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only for order up
Externí odkaz:
http://arxiv.org/abs/2412.08576
Publikováno v:
EPTCS 414, 2024, pp. 58-76
Process algebras have been widely used to verify security protocols in a formal manner. However they mostly focus on synchronous communication based on the exchange of messages. We present an alternative approach relying on asynchronous communication
Externí odkaz:
http://arxiv.org/abs/2412.08235
Autor:
Henning, Sotirios
We define computational atoms named "actions" equipped primarily with three operations: reduction, collection, and inspection. We show how actions can be used for decision-making algorithms from simple axioms. We describe the encodings of typical dat
Externí odkaz:
http://arxiv.org/abs/2412.07939
This work compares large language models (LLMs) and neuro-symbolic approaches in solving Raven's progressive matrices (RPM), a visual abstract reasoning test that involves the understanding of mathematical rules such as progression or arithmetic addi
Externí odkaz:
http://arxiv.org/abs/2412.05586
Autor:
Faverjon, C., Roques, Julien
Publikováno v:
Journal of the London Mathematical Society, 2024, 110 (1)
Many articles have recently been devoted to Mahler equations, partly because of their links with other branches of mathematics such as automata theory. Hahn series (a generalization of the Puiseux series allowing arbitrary exponents of the indetermin
Externí odkaz:
http://arxiv.org/abs/2412.04928
Autor:
Danvy, Olivier
Publikováno v:
EPTCS 413, 2024, pp. 57-92
Seventy years on, Moessner's theorem and Moessner's process -- i.e., the additive computation of integral powers -- continue to fascinate. They have given rise to a variety of elegant proofs, to an implementation in hardware, to generalizations, and
Externí odkaz:
http://arxiv.org/abs/2412.03127
Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition function,
Externí odkaz:
http://arxiv.org/abs/2412.02257
Autor:
Fronk, Colby, Petzold, Linda
Stiff ordinary differential equations (ODEs) are common in many science and engineering fields, but standard neural ODE approaches struggle to accurately learn these stiff systems, posing a significant barrier to widespread adoption of neural ODEs. I
Externí odkaz:
http://arxiv.org/abs/2412.01181
Autor:
Brown, Christopher W.
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both the compute
Externí odkaz:
http://arxiv.org/abs/2412.00963
Large language models (LLMs) have become increasingly pivotal in various domains due the recent advancements in their performance capabilities. However, concerns persist regarding biases in LLMs, including gender, racial, and cultural biases derived
Externí odkaz:
http://arxiv.org/abs/2412.00962