Skip to main content
Theoretical Computer Science
Abuzer Yakaryilmaz's user avatar
Abuzer Yakaryilmaz's user avatar
Abuzer Yakaryilmaz's user avatar
Abuzer Yakaryilmaz
  • Member for 12 years, 10 months
  • Last seen more than a month ago
Profile Activity
Stats
3,707
reputation
27k
reached
22
answers
17
questions
Communities
View all
About

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 founded QWorld (https://qworld.net/) in 2019 and led it until 2024.

Homepage: https://abu.lu.lv

Badges
View all badges
1
gold badge
20
silver badges
38
bronze badges
Top tags
View all tags
53
Score
18
Posts
46
Posts %
48
Score
12
Posts
31
Posts %
47
Score
6
Posts
15
Posts %
37
Score
17
Posts
44
Posts %
21
Score
5
Posts
13
Posts %
16
Score
5
Posts
13
Posts %
Top posts
View all questions and answers
question
28
Probabilistic (randomized) algorithms before "modern" computer science appeared
Sep 11, 2012
question
21
Can $\{a^nb^n\}$ be recognized in poly-time probabilistic sublogarithmic-space?
Sep 27, 2013
question
17
Which results make quantum space interesting?
Apr 17, 2012
question
17
Unary languages recognized by two-way deterministic counter automata
Jul 8, 2012
answer
16
Complexity of a variant of the max word problem. NP-complete?
Jul 10, 2013
answer
15
A "simple" language outside $CFL \cup coCFL$?
Nov 25, 2011
question
14
The best known upper bound for two-way probabilistic finite automata with one-counter
Apr 13, 2012
question
13
Is there any known nontrivial result on QIP systems having a space-bounded verifier?
Apr 1, 2012
question
12
Can multipebble automata decide all deterministic context-sensitive languages?
May 3, 2012
question
12
A super-linear time problem in NL
Jul 25, 2012
Top network posts
View all network posts
8
What is known about coRL and RL?
5
Quantum computers and computable functions