Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in computation-theory

Confusion about NP-hard and NP-Complete in Traveling Salesman problems

Understanding recognizers and deciders in Theory of Computation

How to calculate function points [closed]

NFA to DFA question

Are GPU shaders Turing complete

Minimum pumping length for the following regular languages

What it means lambda calculus is equivalent to turing machine

What is the difference between recursive and recursively enumerable languages

Is { w | w <> w^R } over the alphabet {0,1} a context-free language?

How waterproof is a Swiss cheese? [closed]

Is it possible to create an HTML quine?

Difference between Turing-Decidable and Co-Turing-Decidable

Is there a difference between a "finite state machine" and a "state machine"?

Is constexpr-based computation Turing complete?