A universality theorem for the sequential behaviour of minimal $F$-automata

2017 ◽  
Vol 90 (1-2) ◽  
pp. 33-38
Author(s):  
Gabriel Ciobanu ◽  
Sergiu Rudeanu
2004 ◽  
Vol 9 (4) ◽  
pp. 331-348
Author(s):  
V. Garbaliauskienė

A joint universality theorem in the Voronin sense for L-functions of elliptic curves over the field of rational numbers is proved.


1985 ◽  
Vol 49 (1) ◽  
pp. 317-324 ◽  
Author(s):  
G. Ballardini ◽  
A. Faccani ◽  
M. Fallani ◽  
S. Berti ◽  
V. Vasi ◽  
...  

Author(s):  
Scott Aaronson

One of the crown jewels of complexity theory is Valiant's theorem that computing the permanent of an n × n matrix is # P -hard. Here we show that, by using the model of linear-optical quantum computing —and in particular, a universality theorem owing to Knill, Laflamme and Milburn—one can give a different and arguably more intuitive proof of this theorem.


2011 ◽  
Vol 147 (2) ◽  
pp. 115-128 ◽  
Author(s):  
Hidehiko Mishou

2000 ◽  
Vol 157 ◽  
pp. 211-227 ◽  
Author(s):  
Antanas Laurinčikas ◽  
Kohji Matsumoto

The joint universality theorem for Lerch zeta-functions L(λl, αl, s) (1 ≤ l ≤ n) is proved, in the case when λls are rational numbers and αls are transcendental numbers. The case n = 1 was known before ([12]); the rationality of λls is used to establish the theorem for the “joint” case n ≥ 2. As a corollary, the joint functional independence for those functions is shown.


Sign in / Sign up

Export Citation Format

Share Document