Questions
Linux
Laravel
Mysql
Ubuntu
Git
Menu
HTML
CSS
JAVASCRIPT
SQL
PYTHON
PHP
BOOTSTRAP
JAVA
JQUERY
R
React
Kotlin
×
Linux
Laravel
Mysql
Ubuntu
Git
New posts in computation-theory
Right way to discuss computational complexity for small n
Apr 27, 2022
algorithm
big-o
computation-theory
Does Provable == Decidable?
Sep 16, 2022
computation-theory
decidable
Prove that the set of all languages over a finite alphabet is uncountable
Aug 18, 2022
computation-theory
countable
How to write an enumeration of all computable functions?
Apr 17, 2022
language-agnostic
math
functional-programming
theory
computation-theory
Is a*b* regular?
Oct 23, 2022
regular-language
computation-theory
Is C# 4.0 compile-time turing complete?
Oct 28, 2022
c#-4.0
computation-theory
turing-complete
Context free grammar for non-palindrome
Oct 21, 2022
context-free-grammar
computation-theory
Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s
Mar 19, 2022
regular-language
finite-automata
computation-theory
dfa
what are these arrow operators in context free grammar?
Oct 15, 2022
context-free-grammar
computation-theory
Confusion about NP-hard and NP-Complete in Traveling Salesman problems
Oct 19, 2022
time-complexity
complexity-theory
computation-theory
np
non-deterministic
Understanding recognizers and deciders in Theory of Computation
Oct 15, 2022
computer-science
computation-theory
How to calculate function points [closed]
Sep 16, 2022
theory
computation-theory
function-points
NFA to DFA question
Nov 12, 2022
computer-science
finite-automata
computation-theory
Are GPU shaders Turing complete
Mar 13, 2022
shader
gpu
gpgpu
computation-theory
Minimum pumping length for the following regular languages
Mar 15, 2022
computer-science
regular-language
computation-theory
compiler-theory
What it means lambda calculus is equivalent to turing machine
Feb 10, 2022
functional-programming
computation-theory
lambda-calculus
turing-machines
computability
What is the difference between recursive and recursively enumerable languages
Sep 15, 2022
computer-science
theory
computation-theory
turing-machines
formal-languages
Is { w | w <> w^R } over the alphabet {0,1} a context-free language?
Sep 25, 2022
context-free-grammar
computation-theory
How waterproof is a Swiss cheese? [closed]
Apr 30, 2021
algorithm
shortest-path
computation-theory
Is it possible to create an HTML quine?
Dec 07, 2021
html
computer-science
computation-theory
quine
« Newer Entries
Older Entries »
Menu