I've been assigned to solve an exercise that questions the following: Suppose a function f: N->N that is strictly decreasing. Can we assure f i ...
I've been assigned to solve an exercise that questions the following: Suppose a function f: N->N that is strictly decreasing. Can we assure f i ...
I am reading that a language that is in Disjunctive Normal Form and is satisfiable is a language in P, but there is no explanation, could anyone tell ...
I am currently working in a project in coq where I need to work with lists of nat -> nat. So basically I will have a definition that takes a list ( ...
I had a test a few days ago and failed it, I had a question I did not understand. This is the question: Let's look at the FALSE language: Collect al ...
I have a question from the domain of theoretical computer science. The so-called universal language, L_u, is composed of pairs (M, w) such that w \in ...
How can I express the following function by a lambda term? f(n) = T if n != 0. F if n = 0. n stands for a Church numeral. I know that 0 := λf.λx.x ...
For working with countable sets I have to define a coding function of all finite subsets of N (natural numbers). How can I do this? I started with fin ...
I'm currently reading through John C. Mitchell's Foundations for Programming Languages. Exercise 2.2.3, in essence, asks the reader to show that the ( ...
so here a grammar R and a Langauge L, I want to prove that from R comes out L. so I thought I would prove that L(G) ⊆ L and L(G) ⊇ L are right. fo ...
The characteristics of a computable problem are: Complete means that it covers all the cases; Mechanistic means that it is precise; Determinis ...
To convey the merits of Lambda Calculus, and even JavaScript's ability to implement such (Turing-complete) formulas, I'd like to see the most elegant ...
It is known that there are decidable problems, semi-decidable problems, and undecidable problems. A language that is accepted by a TM (Turing Machine) ...
How long will it take for a program to print a truth table for n propositional symbols? (Symbols: P1, P2, ..., Pn) Can't seem to crack this question ...
This is a question popped into my mind while reading the halting problem, collatz conjecture and Kolmogorov complexity. I have tried to search for som ...
For homework, I was given the following grammar: I computed it using LL(1) just fine. The first sets were: The follow sets were: When I made ...
My understanding is since it is not computable, it may not halt when the answer is 'yes' or 'no'. That's why it cannot be co-recursively enumerable si ...
So I did a problem earlier that said: For that one I said {a^2n , b} because that guarantees a string like aab or aabaab etc. Not sure how to appro ...
In the proof of the halting problem, why do we have to pass the machine and its description as an input? For example, I could have passed the descrip ...
I am trying to prove that the language L = {w ∈ {0, 1} ∗ | Mw(x) ↓ for an input x} is partially decidable but not decidable. Mw is an encoding of M, t ...
Regardless of how the multiplication(or division) operation is implemented(i.e. whether it is a software function or a hardware instruction), it won't ...