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 …
Author: ignougroup
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 …
Finding the maximum bandwidth along a single path in a network
Problem Detail: I am trying to search for an algorithm that can tell me which node has the highest download (or upload) capacity given a weighted directed graph, where weights correspond to individual link bandwidths. I have looked at the maximal Read More …
Infinite alphabet Turing Machine
Problem Detail: Is a Turing Machine that is allowed to read and write symbols from an infinite alphabet more powerful than a regular TM (that is the only difference, the machine still has a finite number of states)? Intuition tells me Read More …
Heuristic for sokoban puzzle problem
Problem Detail: I am trying to write IDA* for Sokoban puzzle problem (http://en.wikipedia.org/wiki/Sokoban) but It seems that my heuristic is not so good for making the algorithm fast. My heuristic is to consider $h(s)$ as minimum distance between the Player and Read More …
Knapsack problem, partition problem, or in general dynamic algorithm with negative numbers allowed
Problem Detail: How to think about dynamic algorithms which allows negative integers in input (where it’s problematic, because obviously it’s not always the case)? Examples: Partition Problem with negative numbers in set allowed Knapsack problem with negative weights are allowed Is Read More …
How can the Operating System run on the same chip it is supposed to be managing?
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 …
