Problem Detail: From my readings about Operating Systems (reading the basic material on Wikipedia, tech sites, etc) I’ve learned that the Operating System is a program that allows programs and applications to interact with the hardware in an efficient and safe Read More …
Category: Uncategorized
Is there a method for automatic runtime analysis of algorithms?
Problem Detail: I am wondering, is there a method for automatic runtime analysis that works at least on a relevant subset of algorithms (algorithms that can be analyzed)? I googled “Automatic algorithm analysis” which gave me this but it is too Read More …
What is a partially computable function?
Problem Detail: In the book Computability, Complexity, and Languages, Martin Davis writes in chapter two: A partial function is said to be partially computable if it is computed by some program. and also A function is said to be computable if Read More …
Creating a Deterministic Push Down Automata
Problem Detail: I saw this old post on stack overflow of a PDA that accepts a language where there are exactly twice as many a’s as there are b’s. The image they used is below and so is the link to Read More …
P-Completeness and Parallel Computation
Problem Detail: I was recently reading about algorithms for checking bisimilarity and read that the problem is P-complete. Furthermore, a consequence of this is that this problem, or any P-complete problem, is unlikely to have an efficient parallel algorithms. What is Read More …
Is word size, the size of a memory location? the size of the data bus? or the cpu register size?
Problem Detail: Is word size, the size of a memory location? the size of the data bus? or the cpu register size? Suppose you have a computer, memory address #0 has byte AB memory address #1 has byte F3 memory address Read More …
Proving ALLTM complement not recognizable
Problem Detail: A few definitions.. $$ begin{align*} mathrm{ALL}_{mathrm{TM}} &= Bigl{langle M rangle ,Big|, text{$M$ a Turing Machine over ${0,1}^{*}$},;; L(M) = {0,1}^{*} Bigr} [2ex] overline{mathrm{ALL}}_{mathrm{TM}} &= Bigl{langle M rangle ,Big|, text{$M$ a Turing Machine over ${0,1}^{*}$},;; L(M) ne {0,1}^{*} Bigr} [2ex] Read More …
Why is $3^n = 2^{O(n)}$ true?
Problem Detail: $3^n = 2^{O(n)}$ is apparently true. I thought that it was false though because $3^n$ grows faster than any exponential function with a base of 2. How is $3^n = 2^{O(n)}$ true? Asked By : David Faux Answered By : SamM Read More …
Construct two functions $f$ and $g$ satisfying $f ne O(g), g ne O(f)$
Problem Detail: Construct two functions $ f,g: R^+ → R^+ $ satisfying: $f, g$ are continuous; $f, g$ are monotonically increasing; $f ne O(g)$ and $g ne O(f)$. Asked By : Jessie Answered By : Shaull There are many examples for such functions. Read More …
Perfect shuffle in parallel processing
Problem Detail: How is Perfect shuffle a better interconnect scheme for parallel processing? For example if we consider a problem of sum reduction, I want to understand how this scheme is useful when implementing sum reduction in parallel , for example Read More …
