Problem Detail: Last fall I went on a tour of the Blue Waters supercomputer at the University of Illinois. I asked whether anyone ever used the entire computer. I was told that it was always working on multiple projects. That made Read More …
IgnouGroup Social Campus
Problem Detail: Last fall I went on a tour of the Blue Waters supercomputer at the University of Illinois. I asked whether anyone ever used the entire computer. I was told that it was always working on multiple projects. That made Read More …
Problem Detail: This particular language: $$L = { u u^R v ,:, u, v in {0, 1}^+}$$ is giving me a lot of trouble. I highly suspect that its non-regular, considering that ${ u u^R : u in {0, 1}^+}$ is Read More …
Problem Detail: I am having difficult time understanding the difference between weakly fair and strongly fair schedulers. Can someone provide an example and explain how they are different? for reference, here are the definitions I have of each: weakly fair: A Read More …
Problem Detail: I am pretty new to Turing Machines and am trying to figure something out. So let’s say I have a tape with input 0 0 1 0 0 1 The language is twice as many 0’s than 1’s. So Read More …
Problem Detail: Dynamical systems are those whose evolution can be described by a rule, evolves with time and is deterministic. In this context can I say that Neural networks have a rule of evolution which is the activation function $f(text{sum of Read More …
Problem Detail: I’m just starting my second year in computer science and one of my classes briefly touched upon deterministic vs. non-deterministic algorithms. This got me thinking – is there any use for algorithms which return deterministic output for certain inputs, Read More …
Problem Detail: In the book “Computational complexity” of Barak and Arora, on page 112, they state that: Theorem 6.15: A language has logspace-uniform circuits of polynomial size iff it is in P. The proof of this one is left as an Read More …
Problem Detail: My textbook says: “We define the function $fcolon mathbb{N}tomathbb{N}$ as follows: $f(1)=2$ and $f(i+1)=2^{f(i)^{1.2}}$. Note that given $n$, we can easily find in $O(n^{1.5})$ time the number $i$ such that $n$ is sandwiched between $f(i)$ and $f(i+1)$.” How can Read More …
Problem Detail: Why operator overloading was included in Python and not in Java? How does one decide to include or exclude operator overloading in a programming language? It is said here that operator overloading is excluded from Java to make the Read More …
Problem Detail: The prefix parity problem can be defined as follows. You are given a string $S$ of length $n$ and initially every character is $0$. Then you want to build a data structure that can support updates such as follows. Read More …