User vzn

17 votes

4 answers

1k views

Is there a TM that halts on all inputs but that property is not provable?

asked Nov 27, 2013 at 21:44

16 votes

4 answers

1k views

Bridge theorems for group theory and formal languages

formal-languages reference-request automata discrete-mathematics group-theory

asked Sep 18, 2013 at 3:16

10 votes

3 answers

5k views

Looking for a dictionary of math/CS notation

terminology reference-request education

asked Dec 13, 2012 at 4:19

5 votes

2 answers

462 views

What are some applications of binary finite fields in CS?

algorithms reference-request discrete-mathematics applied-theory

asked Oct 27, 2012 at 2:40

5 votes

1 answer

390 views

computer science in the movies as an educational angle

education

asked Nov 9, 2013 at 17:02

5 votes

0 answers

129 views

research on OR and AND compression in SAT formulas [closed]

complexity-theory np-complete satisfiability p-vs-np

asked May 20, 2014 at 17:47

5 votes

2 answers

2k views

does every CFL have an ambiguous CFG?

formal-languages formal-grammars ambiguity

asked Jun 5, 2014 at 2:53

5 votes

1 answer

611 views

space complexity of DFA intersection problem

reference-request complexity-classes space-complexity lower-bounds dfa

asked Nov 8, 2015 at 17:18

3 votes

1 answer

198 views

Determining if (infinite) binary language DFAs contain at least 1 prime?

regular-languages automata discrete-mathematics number-theory

asked Oct 10, 2015 at 16:14

3 votes

1 answer

812 views

Description of resolution algorithm as it applies to SAT

algorithms complexity-theory reference-request logic np-complete

asked Jan 28, 2013 at 1:57

3 votes

1 answer

155 views

"Unusual" coupling between a decision problem and a corresponding optimization problem

complexity-theory reference-request optimization decision-problem

asked Dec 3, 2013 at 17:10

3 votes

2 answers

786 views

Enumerating weighted permutations in sorted order problem

algorithms reference-request sorting efficiency enumeration

asked Nov 5, 2013 at 17:32

2 votes

1 answer

327 views

Building functionally complete boolean circuits out of trinary logic

reference-request logic reductions circuits

asked Jan 27, 2013 at 18:15

2 votes

1 answer

2k views

Calculating Binet's formula for Fibonacci numbers with arbitrary precision

algorithms discrete-mathematics floating-point arithmetic mathematical-programming

asked Dec 4, 2012 at 3:33

2 votes

1 answer

203 views

A detail on variant of Mahaney's theorem about reductions of sparse languages vs P/NP

complexity-theory reference-request np-complete reductions p-vs-np

asked Jul 11, 2014 at 1:28

1 vote

0 answers

99 views

Applications of algorithms to stock trading analysis

reference-request machine-learning optimization statistics

asked Jan 31, 2014 at 22:55

1 vote

1 answer

653 views

Blum's speedup theorem in big-O format?

complexity-theory asymptotics

asked Feb 6, 2014 at 1:45

1 vote

1 answer

527 views

context sensitive language finite or infinite

formal-languages computability reference-request undecidability context-sensitive

asked Apr 5, 2016 at 15:44

1 vote

0 answers

73 views

Notable decidable operations on context-sensitive languages [closed]

formal-languages reference-request undecidability context-sensitive

asked May 13, 2014 at 15:31

1 vote

0 answers

26 views

pragmatic way to compute/ search/ match MSBs operation

algorithms time-complexity arithmetic

asked Jun 10, 2015 at 17:22

1 vote

3 answers

459 views

Are there pseudorandom number generators (PRNG) with no finite period?

reference-request number-theory pseudo-random-generators

asked Nov 22, 2013 at 3:12

0 votes

1 answer

114 views

proof of convergence in arbitrary precision PRNGs

algorithms reference-request probability-theory pseudo-random-generators random-walks

asked Nov 18, 2013 at 21:52

0 votes

1 answer

76 views

graph isomorphism completeness of class X and not-X

graphs graph-isomorphism

asked Dec 20, 2013 at 16:26

0 votes

1 answer

145 views

Decidability of fullness of intersection of a CSL with a regular language

formal-languages computability undecidability

asked Jan 18, 2014 at 17:05

0 votes

1 answer

258 views

Blum's speedup theorem showing unclassifiable complexity languages?

complexity-theory

asked Feb 6, 2014 at 2:00

0 votes

0 answers

105 views

2-depth arithmetic circuits and VP vs VNP

complexity-theory reference-request complexity-classes circuits

asked Apr 24, 2015 at 21:07

-1 votes

1 answer

276 views

what are the basic/typical/common mistakes in P=NP claims? [duplicate]

complexity-theory p-vs-np

asked Mar 19, 2014 at 3:57

-1 votes

2 answers

2k views

complexity of decision problems vs computing functions [closed]

algorithms complexity-theory reference-request time-complexity np-complete

asked Sep 22, 2012 at 16:57

-1 votes

1 answer

192 views

References on collective intelligence with respect to CS applications

reference-request education software-engineering books

asked Sep 27, 2012 at 18:26

-1 votes

1 answer

3k views

What is an example for which the purely functional programming approach gives better results than imperative style?

programming-languages functional-programming

asked Oct 3, 2012 at 15:58

Stack Exchange Network

current community

your communities

more stack exchange communities

31 Questions

Is there a TM that halts on all inputs but that property is not provable?

Bridge theorems for group theory and formal languages

Looking for a dictionary of math/CS notation

What are some applications of binary finite fields in CS?

computer science in the movies as an educational angle

research on OR and AND compression in SAT formulas [closed]

does every CFL have an ambiguous CFG?

space complexity of DFA intersection problem

Determining if (infinite) binary language DFAs contain at least 1 prime?

Description of resolution algorithm as it applies to SAT

"Unusual" coupling between a decision problem and a corresponding optimization problem

Enumerating weighted permutations in sorted order problem

Building functionally complete boolean circuits out of trinary logic

Calculating Binet's formula for Fibonacci numbers with arbitrary precision

A detail on variant of Mahaney's theorem about reductions of sparse languages vs P/NP

Applications of algorithms to stock trading analysis

Blum's speedup theorem in big-O format?

context sensitive language finite or infinite

Notable decidable operations on context-sensitive languages [closed]

pragmatic way to compute/ search/ match MSBs operation

Are there pseudorandom number generators (PRNG) with no finite period?

proof of convergence in arbitrary precision PRNGs

graph isomorphism completeness of class X and not-X

Decidability of fullness of intersection of a CSL with a regular language

Blum's speedup theorem showing unclassifiable complexity languages?

2-depth arithmetic circuits and VP vs VNP

what are the basic/typical/common mistakes in P=NP claims? [duplicate]

complexity of decision problems vs computing functions [closed]

References on collective intelligence with respect to CS applications

What is an example for which the purely functional programming approach gives better results than imperative style?