Blog

Problem Detail: I am learning Automated Theorem Proving / SMT solvers / Proof Assistants by myself and post a series of questions about the process, starting here. I keep reading about the Unification Algorithm. What is it and why is so Read More …

Problem Detail: There are many popular languages. But, computer scientists tell us that in order to understand the behaviour of programs in those languages definitely and unambiguously argue upon program behavior (e.g. prove their identity), we need to translate them into Read More …

Problem Detail: Basically I am aware of three foundations for math Set theory Type theory Category theory So in what ways are programming languages and foundations of mathematics related? EDIT The original question was “Programming languages based on foundations of math” Read More …

Problem Detail: Along the same thinking as this statement by Andrej Bauer in this answer The Haskell community has developed a number of techniques inspired by category theory, of which monads are best known but should not be confused with monads. Read More …

Problem Detail: How do people measure performance overhead? Whenever someone is bragging about how their program or application performs better than another, they talk about particular measurements, eg time, performance etc. Whilst I understand how time to perform a task can Read More …

Problem Detail: I am looking for concrete and simple problems that may be solved using bipartite graphs or bipartite graph properties. Any idea along with explanations are welcome. Asked By : Laurent Answered By : John Bupit Assignment Problem would be one such Read More …

Problem Detail: I’m struggling to understand the relationship between NP-Intermediate and NP-Complete. I know that if P != NP based on Lander’s Theorem there exists a class of languages in NP but not in P or in NP-Complete. Every problem in Read More …

Problem Detail: The Mandelbrot set is a beautiful creature in Mathematics. There are a lot of beautiful images of this set created with high precision, so obviously this set is “computable” in some sense. However, what concerns me is the fact Read More …

Problem Detail: Can we define a grammar for the following language? $$L = {a^n b^n c^{n+m} | n,m>=0},. $$ I can define one for this: $$L={a^nb^n|n,m>=0} $$ S –> aSb | λ or this one: $$L={b^nc^{n+m}|n,m>=0} $$ S –> Ac A Read More …

Problem Detail: I need to modify the Dijkstra’s algorithm to get the shortest path in a directed graph and get the one with the least amount of edges if there are equal paths. I am thinking to add another data field Read More …