Computer Science Stack Exchange

2

votes

1

answer

11

views

When and what must be present on the left-hand side of the turnstile in metalogics?

formal-languages notation derivation metalogic

modified 11 mins ago Apass.Jack 17k

24

votes

6

answers

5k

views

Why are reversible gates not used?

computer-architecture

answered 32 mins ago Ryan 1

1

vote

1

answer

28

views

Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)?

turing-machines undecidability semi-decidability

answered 41 mins ago Apass.Jack 17k

0

votes

0

answers

2

views

Dimension Reduction - Which feature should remove to reduce the dimension of the matrix

machine-learning pattern-recognition

modified 59 mins ago Emily Serone 1

1

vote

1

answer

39

views

How to find the number of intervals containing a point when given a static set of intervals?

balanced-search-trees intervals

modified 1 hour ago Community♦ 1

0

votes

0

answers

6

views

Are there well-known multithreaded parameterized programs with superexponential shared memory size in the number of threads?

concurrency formal-methods communication-protocols threads protocols

modified 1 hour ago Leon Meier 101

2

votes

1

answer

15

views

Can such a Turing-recognizable language exist?

turing-machines

answered 3 hours ago Yuval Filmus 202k

1

vote

1

answer

14

views

Log-Space Reduction $USTCON\le_L CO-2Col$

complexity-theory graph-theory reductions

answered 3 hours ago Yuval Filmus 202k

0

votes

0

answers

8

views

Does $\bigcup_{c \ge 1} \mathsf{DTime}(2^{cn})$ closed under polynomial reduction?

complexity-theory reductions

asked 4 hours ago LioH 128

1

vote

2

answers

160

views

Can the pre-order traversal of two different trees be the same even though they are different?

trees binary-trees graph-traversal search-trees

modified 4 hours ago lox 1,007

0

votes

0

answers

8

views

What do “patterns, which separately match parts of a page” and “interactions between patterns” mean?

information-retrieval

asked 5 hours ago Tim 1,769

2

votes

1

answer

20

views

Number of equivalence classes in $P$

complexity-theory time-complexity polynomial-time

modified 5 hours ago MLnoob 13

4

votes

3

answers

281

views

Metagame Paradox: what is wrong with this explanation?

computability turing-machines game-theory

modified 6 hours ago Mike Rosoft 21

3

votes

2

answers

21

views

How do you prove a heuristic is admissible?

artificial-intelligence heuristics

modified 7 hours ago Carlos Linares López 2,884

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore Our Questions

When and what must be present on the left-hand side of the turnstile in metalogics?

Why are reversible gates not used?

Is $ L = \{ a^n\ |\ a^n \not\in L_n \} $ Turing recognizable (recursively enumerable)?

Dimension Reduction - Which feature should remove to reduce the dimension of the matrix

How to find the number of intervals containing a point when given a static set of intervals?

Are there well-known multithreaded parameterized programs with superexponential shared memory size in the number of threads?

Can such a Turing-recognizable language exist?

Log-Space Reduction $USTCON\le_L CO-2Col$

Does $\bigcup_{c \ge 1} \mathsf{DTime}(2^{cn})$ closed under polynomial reduction?

Can the pre-order traversal of two different trees be the same even though they are different?

What do “patterns, which separately match parts of a page” and “interactions between patterns” mean?

Number of equivalence classes in $P$

Metagame Paradox: what is wrong with this explanation?

How do you prove a heuristic is admissible?

Hot Network Questions