Computer Science Stack Exchange

5 votes

6 answers

15k views

Prove if $L = \{0^m1^n \mid m \neq n\}$ is regular or not

Mahesh Jamdade

101

answered 2 days ago

0 votes

2 answers

1k views

In an NFA, what if there are no transitions out of an accept state but there are symbols left in the string?

CommunityBot

1

modified Sep 26 at 14:05

0 votes

1 answer

37 views

How to show that the following function $F$ is primitive recursive?

plshelp

1,271

answered Sep 25 at 18:09

0 votes

1 answer

57 views

Computation branches on NTM

CommunityBot

1

modified Sep 25 at 14:02

0 votes

2 answers

156 views

Show that ALL DFA is decidable

CommunityBot

1

modified Sep 24 at 23:00

0 votes

1 answer

195 views

Are these functions computable?

Noah Schweber

2,487

answered Sep 24 at 19:42

0 votes

1 answer

62 views

How to build a DFA that recognizes a language

CommunityBot

1

modified Sep 24 at 10:00

0 votes

1 answer

638 views

Show that an instance of PCP or MPCP has no solutions

CommunityBot

1

modified Sep 24 at 7:04

0 votes

1 answer

27 views

Infinite loops and the computability of mapping reductions

D.W.♦

145k

answered Sep 24 at 5:20

0 votes

0 answers

18 views

Equivalence between Lambda Calculus [Church] and Computable Partial Functions [Godel]

RFV

111

asked Sep 22 at 9:35

0 votes

2 answers

226 views

IS SUBSET-SUM in P if b(the sum) is given in unary and a1,...,an is in binary?

gnasher729

25.9k

answered Sep 20 at 21:06

1 vote

0 answers

29 views

"Reasonable" requirements for a computation model to be equivalent in power to a Turing machine

Felix Zhang

11

asked Sep 13 at 0:19

12 votes

2 answers

2k views

Halting problem without self-reference

raoof

95

modified Sep 12 at 5:06

1 vote

1 answer

69 views

A decidable language that can't be decided by a circuit ensemble of linear size

CommunityBot

1

modified Sep 9 at 22:01

Stack Exchange Network

Explore our questions

Prove if $L = \{0^m1^n \mid m \neq n\}$ is regular or not

In an NFA, what if there are no transitions out of an accept state but there are symbols left in the string?

How to show that the following function $F$ is primitive recursive?

Computation branches on NTM

Show that ALL DFA is decidable

Are these functions computable?

How to build a DFA that recognizes a language

Show that an instance of PCP or MPCP has no solutions

Infinite loops and the computability of mapping reductions

Equivalence between Lambda Calculus [Church] and Computable Partial Functions [Godel]

IS SUBSET-SUM in P if b(the sum) is given in unary and a1,...,an is in binary?

"Reasonable" requirements for a computation model to be equivalent in power to a Turing machine

Halting problem without self-reference

A decidable language that can't be decided by a circuit ensemble of linear size

Hot Network Questions