Related papers: Rationality is decidable for nearly Euclidean Thur…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities for other agents…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
Many learning algorithms are known to converge to an equilibrium for specific classes of games if the same learning algorithm is adopted by all agents. However, when the agents are self-interested, a natural question is whether agents have…
Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…
The article continues the study of the genus of regular languages that the authors introduced in a 2012 paper. Generalizing a previous result, we produce a new family of regular languages on a two-letter alphabet having arbitrary high…
Are minds subject to laws of physics? Are the laws of physics computable? Are conscious thought processes computable? Currently there is little agreement as to what are the right answers to these questions. Penrose goes one step further and…
One of the most striking features of human cognition is the capacity to plan. Two aspects of human planning stand out: its efficiency and flexibility. Efficiency is especially impressive because plans must often be made in complex…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We provide an explicit bound on the number of periodic points of a rational function defined over a number field, where the bound depends only on the number of primes of bad reduction and the degree of the function, and is linear in the…
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.…
Let X be a variety over a number field and let f: X --> X be an "interesting" rational self-map with a fixed point q. We make some general remarks concerning the possibility of using the behaviour of f near q to produce many rational points…
All possible types of deterministic choice behavior are classified by their degree of irrationality. This classification is performed in three steps: (1) select a benchmark of rationality, for which this degree is zero; (2) endow the set of…
We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…
This paper introduces Flexible First-Order Stochastic Dominance (FFSD), a mathematically rigorous framework that formalizes Herbert Simon's concept of bounded rationality using the Lean 4 theorem prover. We develop machine-verified proofs…
Computational optimal transport (OT) offers a principled framework for generative modeling. Neural OT methods, which use neural networks to learn an OT map (or potential) from data in an amortized way, can be evaluated out of sample after…
What does it mean to claim that a physical or natural system computes? One answer, endorsed here, is that computing is about programming a system to behave in different ways. This paper offers an account of what it means for a physical…
Rationale is defined as a subset of input features that best explains or supports the prediction by machine learning models. Rationale identification has improved the generalizability and interpretability of neural networks on vision and…
Drawing from research on computational models of argumentation (particularly the Carneades Argumentation System), we explore the graphical representation of arguments in a dispute; then, comparing two different traditions on the limits of…