Newest Questions

Ask Question
13,574 questions
Newest Active Bountied Unanswered

Question list filters

Filter by
Sorted by
Tagged with
Filter by Employee ID
Score of -4
0 answers
19 views

At around 13:31 mark of this video about Haskell, the author says that Exit(0) is equivalent to QED I wonder if that's true. I can't find any article writing about this.
Score of 0
0 answers
74 views

I'm reading the recent paper by Fabio F.G. Buono: Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods (here is the Full PDF). The author argues ...
Score of 5
1 answer
376 views

Consider the following matching problem: There are N polyamorous people. Each of them has a list of people they are compatible with. Each of them has a minimum and maximum number of people they want ...
Score of 3
5 answers
543 views

I see formal languages as some form of "applied graph theory" at the moment. As explained Leonards Libkin's book "Elements of Finite Model Theory", formal languages can also be ...
Score of 2
2 answers
748 views

Looking at this part of stack exchange, I feel as if I have been studying nothing in Computer Science. I am a second year undergrad of Mathematics and Computer Science and looking at the questions ...
Score of -4
0 answers
112 views

It is well known that 2‑SAT is in $\mathbf{P}$ while 3‑SAT is $\mathbf{NP}$‑complete. Recently I have been looking at this contrast through the lens of linear logic and proof nets, and a potential ...
Score of 0
0 answers
146 views

I'm simplifying a bit here, but say I have a tiling problem on a chess-like board of $n$ squares and with $n/2$ dominoes, each domino being one of $t$ types of domino. I obtain an algorithm running in ...
Score of 0
0 answers
83 views

Edge-Colored Tile Puzzle You are given a $m × n$ grid of square tiles. Each tile has four edges (top, right, bottom, left), and each edge is assigned one of $K$ colors. The tiles must satisfy the ...
Score of 7
2 answers
896 views

Let $U$ be the set of all computable infinite binary sequences. A (possibly partial) predictor is a partial computable function $$ P:\{0,1\}^* \to \{0,1\}. $$ Given an infinite binary sequence $$ u = ...
Score of 3
1 answer
137 views

I have been reading the chapter "Simple Types: From Evaluation to Normalization" of "Normalization by Evaluation Dependent Types and Impredicativity" by Andreas Abel. I have ...
Score of 2
0 answers
81 views

$\newcommand{\prho}[1]{\phi_{#1}\lceil_\rho}$ I am confused in the proof of Theorem 5.2, on pages 6-7, in Hastad's "The shrinkage exponent of de Morgan formulae is 2." First, let me define ...
Score of 1
0 answers
58 views

If a CA rule is perfectly reversible, meaning every state always uniquely turns into exactly one other state and can always be reversed backward, then how can stable higher-level things ever appear? ...
Score of -1
1 answer
168 views

$\mathsf{P}$ is analogous to the decidable languages, The polynomial-time hierarchy is analogous to the arithmetical hierarchy, what is the computability theory version of $\mathsf{PSPACE}$? It could ...
Score of 5
1 answer
119 views

Consider a finite alphabet $\Sigma$, a nondeterministic automaton $A$ over finite words over $\Sigma$, and a two-way alternating parity tree automaton $B$ working over finite-branching infinite $\...
Score of 0
0 answers
36 views

Simple question about resolution over a CNF formula. I know that read-once resolution, which does not allow the same clause to be re-use in a derivation tree is incomplete. I also know that the ...

15 30 50 per page
1
2 3 4 5
…
905