Problem Detail: In Types and Programming Languages, the family of sets of terms with de Bruijn indices in the untyped $lambda$-calculus is defined in this way: Let $T$ be the smallest family of sets ${T_0, T_1, T_2, …}$ such that $k Read More …
Category: Uncategorized
[Solved]: Matching girls with boys without mutual attraction (variant of maximum bipartite matching)
Problem Detail: Let us say you have a group of guys and and a group of girls. Each girl is either attracted to a guy or not, and vice versa. You want to match as many people as possible to a Read More …
[Solved]: Frame Pointers in Assembler
Problem Detail: I am currently learning assembly programming on wombat 4, I am looking at Frame pointers. I understand exactly what a frame pointer is: it is a register and are used to access parameters on a stack. But i’m confused Read More …
[Solved]: A framework to capture common variation of sequence alignments
Problem Detail: The global alignment problem can be generalized by setting the cost of some boundary gaps to 0. Gaps at both end in both strings have 0 cost, then we get the semiglobal alignment. Gaps are at the left end Read More …
[Solved]: What is the reason of inaccuracy of operations on float numbers?
Problem Detail: I wonder why in JavaScript 0.1 + 0.2 // return 0.30000000000000004 4%0.1 // return 0.09999999999999978 http://jsbin.com/oHISAfU/1/edit (Example) In C the math.h library fmod function printf(“%f”, fmod(4.0,0.1)); // print 0.100000 http://ideone.com/RG5Wyv (Example) And in Spotlight (search feature in the Mac Read More …
[Solved]: Is the set of Gödel numbers of computable constant functions recursively enumerable?
Problem Detail: I’ve been working on the following exercise: $S = { x | f_x text{ is constant} }$. Is $S$ recursively enumerable? Here, $fx$ is the function computed by the $text{x-th TM}$. So it is a computable function. Intuitively, I Read More …
[Solved]: Lower bounds of calculating a function of a set
Problem Detail: Having a set $A$ of $n$ elements, let’s say I want to calculate a function $f(A)$ that is sensitive to all parts of the input, i.e. depends on very member of $A$ (i.e. it is possible to change any Read More …
[Solved]: Building functionally complete boolean circuits out of trinary logic
Problem Detail: There are some not-very-commonly considered forms of trinary logic using 3 truth values. Even entire (unusual/rare) ternary computers have been built from it. Is there some knowledge or reference of how to convert some trinary logic systems into functionally Read More …
[Solved]: Difference between graph-partitioning and graph-clustering
Problem Detail: What is the difference between graph-partitioning and graph-clustering in graph theory? Asked By : suhas bhairav Answered By : Yuval Filmus Graph partitioning and graph clustering are informal concepts, which (usually) mean partitioning the vertex set under some constraints (for example, Read More …
[Solved]: Generating all strings that a regular expressions describe
Problem Detail: I’m having trouble generating the set of strings, which a regular expressions describe. A typical regular expression can look like this: [atom_0] atom_1 (atom_2 | atorm_3 | … | atom_n-1) <var> [atom_n] Or any other combination of the following: Read More …
