10
How can the class of tail recursive functions be compared to the classes of PR and R?
cs.stackexchange.com
10
Is It appropriate for students to express interest in becoming a non-funded TA for a specific course?
academia.stackexchange.com
10
Is a unary language regular iff its exponent is a linear function?
cs.stackexchange.com
10
anonymous lambda functions (functional programming)
cs.stackexchange.com
10
Total functional programming language without an static type checker
cs.stackexchange.com
9
Why proving programs correctness doesn't have the same importance as algorithms analysis or the theory of computation in practice?
cs.stackexchange.com
9
What does Big O notation actually specify?
cs.stackexchange.com
9
How to use Type application Rule to get a desired type
cs.stackexchange.com
9
How to transpile generic functions into language that do not support generics?
cs.stackexchange.com
9
How does (non)deterministic time relate to verifiability?
cs.stackexchange.com
9
Infinite Intersection/Union of regular languages
cs.stackexchange.com
9
How can Computer Science theories and inquiries be resolved?
cs.stackexchange.com
9
The Rock, Paper, Scissors, Lizard, Spock Tournament of Epicness
codegolf.stackexchange.com
9
Why is NP not trivially equal to Co-NP? (a.k.a. what does Co-NP mean exactly?)
cs.stackexchange.com
9
Post-doc for two (two-body problem): How to search, apply, and improve our chances?
academia.stackexchange.com
9
How to efficiently engage undergraduate students in my research program?
academia.stackexchange.com
9
Push Down Automatons "guess" - what does that mean?
cs.stackexchange.com
8
Why doesn't descriptive complexity theory solve P = NP?
cs.stackexchange.com
8
Undecidable predicate logic is decidable by people?
cs.stackexchange.com
8
Why theorem proving is hard?
cs.stackexchange.com
8
Is there a repository for the hierarchy of proofs?
cs.stackexchange.com
8
In what intensional type theories can absurdity be made definitionally proof irrelevant?
proofassistants.stackexchange.com
8
Prove Context Free languages not closed under difference?
cs.stackexchange.com
8
Why is Church-Rosser so important for basing programming languages on lamdba-calculus?
cs.stackexchange.com
8
Are numbers types and what is "Number"?
cs.stackexchange.com
8
Can we reduce an NP complete item to an NP item which is $\bf{non}$ P?
cs.stackexchange.com
8
Does the the undecidability of the Halting Problem eliminate the possibility of 'Hard AI'?
cs.stackexchange.com
8
For every imperative function, is there a functional counterpart with identical performance or even instructions?
cs.stackexchange.com
8
Why does this automation accept the empty string?
cs.stackexchange.com
8
Relationship of algorithm complexity and automata class
cs.stackexchange.com
prev
1
2
3
4
5
6
next