user avatar
user avatar
user avatar
vzn
  • Member for 10 years, 3 months
  • Last seen more than 1 year ago
17 votes
4 answers
1k views

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

16 votes
4 answers
1k views

Bridge theorems for group theory and formal languages

10 votes
3 answers
5k views

Looking for a dictionary of math/CS notation

5 votes
2 answers
462 views

What are some applications of binary finite fields in CS?

5 votes
1 answer
390 views

computer science in the movies as an educational angle

5 votes
0 answers
129 views

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

5 votes
2 answers
2k views

does every CFL have an ambiguous CFG?

5 votes
1 answer
611 views

space complexity of DFA intersection problem

3 votes
1 answer
198 views

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

3 votes
1 answer
812 views

Description of resolution algorithm as it applies to SAT

3 votes
1 answer
155 views

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

3 votes
2 answers
786 views

Enumerating weighted permutations in sorted order problem

2 votes
1 answer
327 views

Building functionally complete boolean circuits out of trinary logic

2 votes
1 answer
2k views

Calculating Binet's formula for Fibonacci numbers with arbitrary precision

2 votes
1 answer
203 views

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

1 vote
0 answers
99 views

Applications of algorithms to stock trading analysis

1 vote
1 answer
653 views

Blum's speedup theorem in big-O format?

1 vote
1 answer
527 views

context sensitive language finite or infinite

1 vote
0 answers
73 views

Notable decidable operations on context-sensitive languages [closed]

1 vote
0 answers
26 views

pragmatic way to compute/ search/ match MSBs operation

1 vote
3 answers
459 views

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

0 votes
1 answer
114 views

proof of convergence in arbitrary precision PRNGs

0 votes
1 answer
76 views

graph isomorphism completeness of class X and not-X

0 votes
1 answer
145 views

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

0 votes
1 answer
258 views

Blum's speedup theorem showing unclassifiable complexity languages?

0 votes
0 answers
105 views

2-depth arithmetic circuits and VP vs VNP

-1 votes
1 answer
276 views

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

-1 votes
2 answers
2k views

complexity of decision problems vs computing functions [closed]

-1 votes
1 answer
192 views

References on collective intelligence with respect to CS applications

-1 votes
1 answer
3k views

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