Related papers: Efficient Computation of Collatz Sequence Stopping…
Recent advances in reasoning models have demonstrated significant improvements in accuracy by employing detailed and comprehensive reasoning processes. However, generating these lengthy reasoning sequences is computationally expensive and…
Exploring the Collatz Conjecture and changing the expression from 3n + 1 to 5n + 1, we found patterns in different sets of numbers. Some numbers reduce to one (as stated in the Collatz Conjecture), some might escape to infinity, and some…
The Kaczmarz algorithm is an iterative method that solves linear systems of equations. It stands out among iterative algorithms when dealing with large systems for two reasons. First, at each iteration, the Kaczmarz algorithm uses a single…
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…
We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by…
Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily…
The Collatz and $abc$ conjectures, both well known and thoroughly studied, appear to be largely unrelated at first sight. We show that assuming the $abc$ conjecture true is helpful to improve the lower bound of integers initiating a…
Kaczmarz algorithm is an efficient iterative algorithm to solve overdetermined consistent system of linear equations. During each updating step, Kaczmarz chooses a hyperplane based on an individual equation and projects the current estimate…
We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…
In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…
The Collatz Conjecture's connection to dynamical systems opens it to a variety of techniques aimed at recurrence and density results. First, we turn to density results and strengthen the result of Terras through finding a strict rate of…
Empirical, theoretical and historical aspects of Post's "problem of tag" from 1921 are explored. Evidence of strong computational irreducibility is found. Despite their deterministic origin, the lengths of successive sequences generated…
In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…
Voltage peaks on a conventional computer's power lines allow for the well-known dangerous DPA attacks. We show that measurement of a quantum computer's transient state during a computational step reveals information about a complete…
The Kaczmarz algorithm is a simple iterative scheme for solving consistent linear systems. At each step, the method projects the current iterate onto the solution space of a single constraint. Hence, it requires very low cost per iteration…
Reasoning large language models achieve impressive test-time scaling by thinking for longer, but this performance gain comes at significant compute cost. Directly limiting test-time budget hurts overall performance, but not all problems are…
This paper proposes a formula expression for the well-known Collatz conjecture (or 3x+1 problem), which can pinpoint all the growth points in the orbits of the Collatz map for any natural numbers. The Collatz map $Col: \mathcal{N}+1…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
Let $\sigma_n=\lfloor1+n\cdot\log_23\rfloor$. For the Collatz 3x + 1 function exists for each $n\in\mathbb{N}$ a set of different residue classes $(\text{mod}\ 2^{\sigma_n})$ of starting numbers $s$ with finite stopping time…