A message from our CEO about the future of Stack Overflow and Stack Exchange. Read now.
Theoretical Computer Science
Meta user
Network profile
3,575
reputation
1
16
37

Abuzer Yakaryilmaz

I have been a theoretical computer scientist working on quantum automata and complexity theory.

Recently, I started to be interested in quantum programming and quantum software.

I have been fully involved with many initiatives on education of quantum computing and quantum programming: QWorld, QCousins, QDrive, QKitchen, QSemester, and Bronze. More info is at http://abu.lu.lv

21
answers
16
questions
~19k
people reached
  • Riga, Latvia
  • abu.lu.lv
  • Member for 8 years, 2 months
  • 397 profile views
  • Last seen Dec 3 '19 at 9:55

Communities (5)

Top network posts

Top tags (44)

Score 52
Posts 18
Posts % 49
Score 46
Posts 11
Score 46
Posts 6
Score 37
Posts 17
Score 21
Posts 5
Score 16
Posts 5
View all tags →

Top posts (37) All Questions Answers | Votes Newest

27 Probabilistic (randomized) algorithms before “modern” computer science appeared Sep 11 '12
21 Can $\{a^nb^n\}$ be recognized in poly-time probabilistic sublogarithmic-space? Sep 27 '13
17 Which results make quantum space interesting? Apr 17 '12
17 Unary languages recognized by two-way deterministic counter automata Jul 8 '12
16 Complexity of a variant of the max word problem. NP-complete? Jul 10 '13
15 A “simple” language outside $CFL \cup coCFL$? Nov 25 '11
14 The best known upper bound for two-way probabilistic finite automata with one-counter Apr 13 '12
13 Is there any known nontrivial result on QIP systems having a space-bounded verifier? Apr 1 '12
12 Can multipebble automata decide all deterministic context-sensitive languages? May 3 '12
12 What is the simplest computational model for which the emptiness problem is undecidable? Mar 25 '14
View all questions and answers →

Badges (54)

Gold

1

Rarest

Silver

16

Rarest

Bronze

37

Rarest

View all badges →