Author: ignougroup

Problem Detail: I am reading about dependent types theory in the Homotopy Type Theory online book. In section 1.3 of the Type Theory chapter, it introduces the notion of hierarchy of Universes: $mathcal{U}_0 : mathcal{U}_1 : mathcal{U}_2 : cdots$, where every Read More …

Problem Detail: I’m just learning about Turing Machines, and I’m a bit confused by the difference in formal description between Wikipedia and my textbook. My textbook says the following: $$M=langle Q,Sigma,Gamma,delta,q_{0},q_{accept}, q_{reject} rangle$$ where: $Q$ is the set of states, $Sigma$ Read More …

Problem Detail: I am trying to wrap my head around recursion and divide and conquer algorithms. Can someone provide a proof and explanation of how many times a list of n elements can be divided in 1/2 on both sides.. In Read More …

Problem Detail: Alexia Massalin’s Dissertation on Synthesis was a Phd thesis on Operating Systems that contained a concept called ‘Quajects’ (see Chapter 4). This is some additional commentary on the Phd Thesis. Best I can work out – a Quaject is Read More …

Problem Detail: Say that there are $n$ days and there is $x_1, x_2, …,x_n$ amount of data to process on each day. Your computer can process $s_1$ amount of work on the first day since rebooting your computer, $s_2$ work on Read More …

Problem Detail: I have a faint notion of what NP hard is (that a problem is legit difficult 3 SAT for example). I have forgotten what coNP hard, and Wikipedia tells me that the complement of coNP hard is NP hard…not Read More …

Problem Detail: Forgive my ignorance, but I am very new to the publishing process in Computer Science. I have some research that I have done involving analyzing data formats used in web-based image processing applications being presented in various IEEE papers. Read More …

Problem Detail: I am having a problem trying to solve a question on a past paper asking to design a security lattice. Here is the question: The AB model (Almost Biba) is a model for expressing integrity policies rather than confidentiality. Read More …

Problem Detail: I have a problem which essentially reduces to this: You have a black-box function that accepts inputs of length $n$. You can measure the amount of time the function takes to return the answer, but you can’t see exactly Read More …

Problem Detail: Based on the Wikipedia page for a formal system, will all programming languages be contained within the following rules? A finite set of of symbols. (This seems obvious since the computer is a discrete machine with finite memory and Read More …