phs

Member for 10 years, 5 months
Last seen more than a month ago

Paris, France

Summary

Reputation

851

851
821
791

2020
2021
2022
2023

Top tag

complexity-theory

Next privilege

1,000 Rep.

See votes

Badges

5

7

Newest

Enlightened

Next badge

0/1

Custodian

Answers

View all 22 answers

Score Activity Newest

11

Is Post Correspondence Problem in NP?

Nov 16, 2015

10

Class of the language only containing the empty string?

Nov 25, 2015

8

If the universe were predetermined, would non-deterministic automata still make sense?

Nov 14, 2015

5

if $\delta(q, a) = q$ for all symbols $a$, show that $\delta^* (q, w) = q$ is true for all strings $w$

Nov 12, 2015

5

What does it mean for a problem to be both NP hard and coNP hard

Dec 2, 2015

Questions

Score Activity Newest Views

This user has not asked any questions

Tags

View all 42 tags

complexity-theory

17

Score

4

posts

automata

17

Score

4

posts

formal-languages

13

Score

3

posts

decision-problem

11

Score

1

post

np

11

Score

1

post

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

5

silver badges

Enlightened

Oct 15, 2020
Yearling

× 4

Dec 6, 2019

7

bronze badges

Commentator

Sep 11, 2015
Nice Answer

× 2

Oct 15, 2020
Teacher

Jul 13, 2013

Accounts

View all 31 accounts

1,105
6
13

Computer Science

851
5
7

Theoretical Computer Science

565
2
11

541
3
18

443
3
12

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

51

upvotes

23

question votes

28

answer votes