Related papers: Finitary reducibility on equivalence relations
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We report on a recent conjecture by Gisin on a restriction of physical processes in sets of finite information numbers (FIN) and further analyze the entropic constraint associated with the proposed algorithm. In the course, we provide a…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
We review the notion of reducibility and we introduce and discuss the notion of orbital reducibility for autonomous ordinary differential equations of first order. The relation between (orbital) reducibility and (orbital) symmetry is…
Binary relations are an important abstraction arising in many data representation problems. The data structures proposed so far to represent them support just a few basic operations required to fit one particular application. We identify…
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
In this paper, we show that the class of representable residuated semigroups has the finite representation property. That is, every finite representable residuated semigroup is representable over a finite base. This result gives a positive…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
This paper is a reflexion on the computability of natural language semantics. It does not contain a new model or new results in the formal semantics of natural language: it is rather a computational analysis of the logical models and…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…
In this article we define a new reducibility based on the enumeration orders of r.e. sets.