2,025 research outputs found
Transformations Integer Sequences And Pairing Functions
We propose several procedures for creating new families of integer sequences
based on the method of Cantor diagonalization. Then we modify and generalize
this method. The paper includes explicit formulas for most proposed families of
integer sequences.Comment: 13 page
Enumeration and Decidable Properties of Automatic Sequences
We show that various aspects of k-automatic sequences -- such as having an
unbordered factor of length n -- are both decidable and effectively enumerable.
As a consequence it follows that many related sequences are either k-automatic
or k-regular. These include many sequences previously studied in the
literature, such as the recurrence function, the appearance function, and the
repetitivity index. We also give some new characterizations of the class of
k-regular sequences. Many results extend to other sequences defined in terms of
Pisot numeration systems
The Complexity Of The NP-Class
This paper presents a novel and straight formulation, and gives a complete
insight towards the understanding of the complexity of the problems of the so
called NP-Class. In particular, this paper focuses in the Searching of the
Optimal Geometrical Structures and the Travelling Salesman Problems. The main
results are the polynomial reduction procedure and the solution to the Noted
Conjecture of the NP-Class
On the Invariance of G\"odel's Second Theorem with regard to Numberings
The prevalent interpretation of G\"odel's Second Theorem states that a
sufficiently adequate and consistent theory does not prove its consistency. It
is however not entirely clear how to justify this informal reading, as the
formulation of the underlying mathematical theorem depends on several arbitrary
formalisation choices. In this paper I examine the theorem's dependency
regarding G\"odel numberings. I introduce deviant numberings, yielding
provability predicates satisfying L\"ob's conditions, which result in provable
consistency sentences. According to the main result of this paper however,
these "counterexamples" do not refute the theorem's prevalent interpretation,
since once a natural class of admissible numberings is singled out, invariance
is maintained.Comment: Forthcoming in The Review of Symbolic Logi
Breadth-first serialisation of trees and rational languages
We present here the notion of breadth-first signature and its relationship
with numeration system theory. It is the serialisation into an infinite word of
an ordered infinite tree of finite degree. We study which class of languages
corresponds to which class of words and,more specifically, using a known
construction from numeration system theory, we prove that the signature of
rational languages are substitutive sequences.Comment: 15 page
- …