相关论文: Computing Fibonacci numbers on a Turing Machine

Vagueness is a linguistic phenomenon as well as a property of physical objects. Fuzzy set theory is a mathematical model of vagueness that has been used to define vague models of computation. The prominent model of vague computation is the…

In this paper, we study norms of circulant and $r-$circulant matrices involving harmonic Fibonacci and hyperharmonic Fibonacci numbers. We obtain inequalities by using matrix norms.

Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum…

Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.

As was well known, in classical computation, Turing machines, circuits, multi-stack machines, and multi-counter machines are equivalent, that is, they can simulate each other in polynomial time. In quantum computation, Yao [11] first proved…

P systems are computing conceptual computing devices that are at least as powerful as Turing machines. However, until recently it was not known how one can encode any recursive function as a P~system. Here we propose a new encoding of…

In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…

Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical…

We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…

The power of real-time Turing machines using sublinear space is investigated. In contrast to a claim appearing in the literature, such machines can accept non-regular languages, even if working in deterministic mode. While maintaining a…

Lecture notes on quantum machine learning for computer scientists.

A configuration of light pulses is generated, together with emitters and receptors, that allows computing. The computing is extraordinarily high in number of flops per second, exceeding the capability of a quantum computer for a given size…

We explain the use of category theory in describing certain sorts of anyons. Yoneda's lemma leads to a simplification of that description. For the particular case of Fibonacci anyons, we also exhibit some calculations that seem to be known…

The Binet-Fibonacci formula for Fibonacci numbers is treated as a q-number (and q-operator) with Golden ratio bases $q=\phi$ and $Q=-1/\phi$. Quantum harmonic oscillator for this Golden calculus is derived so that its spectrum is given just…

In this paper, we find all integers $c$ having at least two representations as a difference between a Fibonacci number and a Tribonacci number.

Computations in the cohomology of finite groups.

Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those…

Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…