IgnouGroup Social Campus
Problem Detail: Can somebody please help me understand ways I can attempt to find two functions f(x) and g(x) in which f(x) is in big O of g(x) but not big theta of g(x). I get that this is asking me Read More …
Problem Detail: Given a graph $G = (V, E)$, find $k$ vertices ${v^*_1,dots,v^*_k}$, which removal would result in a graph with smallest largest component. I assume for large $n = |V|$ and large $k$ the problem is difficult (NP-hard), but I Read More …
Problem Detail: I want to implement following algorithm on Turing machine: rewrite binary numbers to their unary counterparts. For example: 101 will be rewritten to a string of 5 consecutive bars (wikipedia) But I don’t know how to make the replacement Read More …
Problem Detail: The Institute for Advanced Study has had a year-long special program devoted to the Univalent Foundations Program. At the end of this they have produced a book and a code repository. At the end of this we see a Read More …
Problem Detail: We were asked this question in exam and I am not satisfied with the answer the teacher gave. Let me justify my point of view. Let there be a polynomial time function having time complexity $n^{c_1}$. If we call Read More …
Problem Detail: As the above question says. I’m wondering if a transition system is the same as a program graph or they are two different things? Thank you. Asked By : Deyaa Answered By : hengxin You did not provide any particular resources Read More …
Problem Detail: Question: To what extent is it known (or believed) that Chuck Moore and Don Knuth had influence on each other’s thoughts on ideal machines, or their work on algorithms? I’m interested in citations, interviews, articles, links, or any other Read More …
Problem Detail: I’m looking for examples of loops that have running time $O(nm)$, $O(n+m)$ and $O(nlog m)$ to help me understand these concepts. Could anybody give some examples and explain why they have the given running time? Asked By : om471987 Answered Read More …
Problem Detail: I’m studying about Local Binary Pattern and I’m having trouble understanding the following part about the number of output labels for binary patterns from Computer Vision using Local Binary Patterns, by Pietikäinen et al. (2011): Another extension to the Read More …
Problem Detail: Most of us know the correspondence between combinatory logic and lambda calculus. But I’ve never seen (maybe I haven’t looked deep enough) the equivalent of “typed combinators”, corresponding to the simply typed lambda calculus. Does such thing exist? Where Read More …
