Category: Uncategorized

Problem Detail: A non-erasing Turing machine is one that cannot replace a symbol with a blank unless the symbol under the read head is a blank. I’m trying to understand whether there is loss of generality because of this restriction. My Read More …

Problem Detail: in order to solve a DARP problem I created a Python class, that can generate random graphs. I attribute a random number to every edge which represents the cost to travel over that edge. My current solution for connecting Read More …

Problem Detail: Today I heard of BNF which is a language for languages. Also heard that it specifies the entire syntax of C in four pages. So I thought of checking it out. After reading through this page, I got a Read More …

Problem Detail: I would like to understand why and when polynomial algorithms became of interest. When did people realize the role and importance of efficient versus non-efficient algorithms? Did that happen when the concept of an algorithm was discovered, or the Read More …

Problem Detail: Suppose I am given $n$ fixed width integers (i.e. they fit in a register of width $w$), $a_1, a_2, dots a_n$ such that their sum $a_1 + a_2 + dots + a_n = S$ also fits in a register Read More …

Problem Detail: this is my first question on this site. I‌ recently, study on NP. I have some confusion about this Topic, and want to propose my inference and some one verify me. I) each NP problem can be solved in Read More …

Problem Detail: I asked this question in SO here I have about 1000 sets of size <=5 containing numbers 1 to 100. {1}, {4}, {1,3}, {3,5,6}, {4,5,6,7}, {5,25,42,67,100} … Is it possible to find a set of size 20 that contains Read More …

Problem Detail: What does the notation co- mean when prefixing co-NP, co-RE (recursively enumerable), or co-CE (computably enumerable) ? Asked By : Vanwaril Answered By : Gilles Often, in mathematical terminology, the prefix co- refers to a dual in some sense. For complexity Read More …

Problem Detail:  A) Solve this recurrence where $T(0)=0$ and write it in O-notation: $T(n)= {2 over n} (T(0)+T(1)+…+T(n-1))+c$ So, I started to calculate: $T(1)=2(0)+c=c$ $T(2)=1(0+c)+c=2c$ and so on, which gives me that $T(n)=nc$ This I can prove by induction: $(n-1) Read More …

Problem Detail: A computer has 2 GB of RAM of which the operating system occupies 256 MB. The processes are all 128 MB (for simplicity) and have the same characteristics. If the goal is 99% CPU utilization, what is the maximum Read More …