Network profile

user3472798

Reputation

411

411
306
201

2017
2018
2019
2020

Top tag

turing-machines

Next privilege

500 Rep.

Access review queues

Badges

1

4

9

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

13 votes cast

9 Questions

Votes Activity Newest Views

6

12

votes

3

answers

23k

views

How does an NFA use epsilon transitions?

automata finite-automata nondeterminism

Sep 8 '16 at 13:44 Community♦ 1

6

votes

2

answers

2k

views

What is 'halting'?

terminology computability turing-machines

Feb 11 '15 at 8:25 Raphael♦ 67.4k

2

5

votes

2

answers

8k

views

What is an “encoding” of a TM?

turing-machines automata reductions encoding-scheme

Nov 18 '15 at 12:07 Raphael♦ 67.4k

2

votes

3

answers

103

views

Graph cycles on 40 vertices

algorithms graphs polynomial-time search-problem

Mar 9 '15 at 19:36 Community♦ 1

1

vote

1

answer

80

views

Unification Functions

artificial-intelligence unification

Nov 15 '15 at 3:12 D.W.♦ 118k

1

vote

0

answers

40

views

Proving that a language is regular [duplicate]

formal-languages

Oct 5 '15 at 3:58 user3472798 411

1

1

vote

1

answer

1k

views

MIPS with one read port in the register file?

computer-architecture

Mar 10 '15 at 11:37 Wandering Logic 16k

1

1

vote

1

answer

131

views

number of different undirected graphs?

graphs

Apr 5 '14 at 1:37 Yuval Filmus 220k

0

votes

1

answer

447

views

Proving that it's decidable whether a TM ever moves on the blank input

computability turing-machines

Feb 6 '15 at 20:50 David Richerby 77.1k

Computer Science Stack Exchange works best with JavaScript enabled