Problem Detail: I have a question about definability of truth assignments. Suppose that I am working in the context of propositional logic. Let me give some definitions first. Let $L$ be a propositional language with the set $Prop_{L}$ of propositional variables. Read More …
Author: ignougroup
[Solved]: Quick Sort: Randomized Pivot vs Median of 3/’Ninther’ Pivot vs Uniform Shuffle of Input
Problem Detail: Is the jury still out on this or do we now know which of the above mentioned ways of randomizing Quick Sort is the most optimum as far as average case running time (averaged over all possible input arrays, Read More …
[Solved]: Why can L3 caches hold only shared blocks?
Problem Detail: In a recent CACM article [1], the authors present a way to improve scalability of shared and coherent caches. The core ingredient is assuming the caches are inclusive, that is higher-level caches (e.g. L3, one global cache) contain all Read More …
[Solved]: LR(0) expressive power
Problem Detail: So I have grouped the following formalisms into a power hierarchy (and made classes for them): Class 1 DFA NFA NFAϵ reg.exp Class 2 (DCFL expressivity?) LR(1) DPDA Class 3 CFG PDA Class 4 TM NTM Class 4 is Read More …
[Solved]: Odd Parity Function
Problem Detail: I am trying to define a Odd Parity Function that takes three 1 bit inputs and will output a 1 if the 3 bits are odd as a Boolean function. 1 1 0 = 0 1 0 0 = Read More …
[Solved]: Counting with constant space bounded TMs
Problem Detail: The problem, coming from an interview question, is: You have a stream of incoming numbers in range 0 to 60000 and you have a function which will take a number from that range and return the count of occurrence Read More …
[Solved]: all pairs shortest path using Dijkstra
Problem Detail: So, I have a list of cities (A, B, C, etc) with weighted edges (two-way, undirected) between them with a list of cities that already have a store. My task is to place a one new store at either Read More …
[Solved]: Is it possible to solve parity game problem in polynomial time?
Problem Detail: Is it practically possible or even near possible to make parity game to be solved in polynomial time? If yes, how? and if No, why? Asked By : Andy Answered By : Shaull Parity games are famously known to be in Read More …
[Solved]: What determines valid and invalid turing machines?
Problem Detail: According to my understanding, a Turing machine that’s valid has to have finite steps to finish a certain step. If this is right, what else determines the validity of a turing machine? Asked By : Shelby. S Answered By : Jonathan Read More …
[Solved]: Difference between Dominant strategy and Winning Strategy
Problem Detail: I am a little bit confused by the definition of dominant strategy and winning strategy, what’s the difference between them. Following are the definitions taken from wikipedia, below every definition I added some thoughts. If you fell that my Read More …
