Problem Detail: I recently learned about the rolling hash data structure, and basically one of its prime uses to searching for a substring within a string. Here are some advantages that I noticed: Comparing two strings can be expensive so this Read More …
Category: Uncategorized
[Solved]: Introduction to complexity and computability
Problem Detail: I’m looking for a good book that explains these subjects in a readable way. Any suggestions ? I currently pursuing my BSC in computer science, and I just failed to pass the course introduction to thr theory of computation Read More …
[Solved]: Fixed base exponentiation with precomputations
Problem Detail: I’m trying to compute $g^m$ mod $n$ where $m,n$ are 1024-bit numbers. The method I want to use is fixed base exponentiation with precomputations, also known as fixed-base windowing.The paper I’m following is Brickell et. al. “Fast Exponentiation with Read More …
[Solved]: In the Curry-Howard isomorphism as applied to Hindley-Milner types, what proposition corresponds to a -> [a]?
Problem Detail: (Using Haskell syntax, since the question is inspired by Haskell, but it applies to general Hindley-Milner polymorphic type systems, such as SML or Elm). If I have a type signature f :: a -> [a], what is the logical Read More …
[Solved]: Table-Driven Agent Program
Problem Detail: I have two questions regarding a paragraph about table-driven agent programs from Modern Approach to Artificial Intelligence 3rd Edition. “Let $mathbb{P}$ be the set of possible percepts and let T be the lifetime of the agent (the total number Read More …
[Solved]: Greedy algorithm for Set Cover problem – need help with approximation
Problem Detail: I want to approximate how close is the greedy algorithm to the optimal solution for the Set Cover Problem, which I’m sure most of you are familiar with, but just in case, you can visit the link above. The Read More …
[Solved]: Why are non-relativizing proofs preferred to relativizing ones?
Problem Detail: I apologize, but even after these two other posts: here and here I’m still having trouble understanding oracle TMs and relativization. This question comes at the issue from a different angle: Why are non-relativizing proofs considered more valid than Read More …
[Solved]: simulation of PDA with turing machine
Problem Detail: How to simulate a non-deterministic PDA with a turing machine? Asked By : odai Answered By : muratcakmak The sets of all languages that can be represented by a PDA is proper subset of the all languages that can be represented Read More …
[Solved]: provability of while loop vs for loop
Problem Detail: I’m abit afraid to ask this question here seeing as I asked it on programmers SE already, the thing is I think the question is more about the underlying theory than the use in practice (or call it confirmation Read More …
[Solved]: Fundamental algorithms in formal language-automata theory
Problem Detail: I’m willing to take a course in formal languages and automata theory , where we will explore side by side a functional programming language to implement the different algorithms we will encounter ,despite i am new to the language Read More …
