Problem Detail: In a comment to Learning F#: What books using other programming languages can be translated to F# to learn functional concepts? Makarius stated: Note that the “CPS” approach has done great harm to performance in SML/NJ. Its physical evaluation Read More …
Category: Uncategorized
[Solved]: How to random-generate a graph with Pareto-Lognormal degree nodes?
Problem Detail: I have read that the degree of nodes in a “knowledge” graph of people roughly follows a power law distribution, and more exactly can be approximated with a Pareto-Lognormal distribution. Where can I find a kind of algorithm that Read More …
[Solved]: Counting the number of N-dimensional coprime integer vectors
Problem Detail: I am looking for an efficient way to count the number of coprime vectors in a finite and bounded set of integer vectors. The vectors in my set are $N$-dimensional integer vectors whose components are bounded on the top Read More …
[Solved]: Showing that tournament sort requrires O(n log n) comparisons
Problem Detail: I wish I could think of a better way to word my question. Maybe some one here could offer s suggestion for that, as well. On to my question. Before I do, this is a class question that has Read More …
[Solved]: The control in the Turing Machine
Problem Detail: My question is about the control in the Turing Machine. As far as I know, the control of the Turing Machine is just a set of states. If the Machine needs to record something, it needs to write on Read More …
[Solved]: Is {ww^r ww^r} a context-free language?
Problem Detail: Is the language $L = {w w^r w w^r mid w in Sigma^*}$ context-free? ($w^r$ is the reversal of $w$.) I heard that by using the pumping lemma, we can only prove that a language is not context-free, but Read More …
[Solved]: Formal notion of a call graph for Turing machines
Problem Detail: To most computer programs one can assign a “call graph“. Is there a formal notion of call graphs of Turing machines? Motivation is, that one could intuitively call a decidable language $L$ “irreducible” if every Turing machine which decides Read More …
[Solved]: What CS Textbooks should I buy?
Problem Detail: I am preparing to graduate high school. Although I do not intend to study computer science in college, I feel like it might be useful to familiarize myself with the theoretical CS concepts taught in academia (eg. algorithms, structures, Read More …
[Solved]: Quadratic residue and integer factoring
Problem Detail: I often read that deciding whether or not a number $r$ is a quadratic residue modulo $n$ is an interesting (and hard) problem from number theory (especially if $n$ is not prime). I am looking at the following special Read More …
[Solved]: Which properties of context sensitive languages are decidable?
Problem Detail: There are two context-sensitive languages, $L_1$ and $L_2$. Which of the following statements about them are decidable respectively undecidable? $L_1 = emptyset$ $L_1 = Sigma^*$ $L_1 cap L_2 = emptyset$ $overline{L_1}$ is also a context-sensitive language. $L_1 = L_2$ Read More …
