<we><edit> <!-- questions and answers -->
np-complete
randomness
parsers
graph-theory
space-complexity
network-flow
semantics
cpu-cache
graph-traversal
search-algorithms
halting-problem
data-compression
complexity-theory
heuristics
sorting
computer-vision
linear-algebra
greedy-algorithms
np-hard
recursion
circuits
arithmetic
database-theory
programming-languages
matrices
turing-machines
Constructing a turing machine from a PDA - dealing with non-determinism
turing-machines
pushdown-automata
simulation
type 0 grammar to simulate turing machine
turing-machines
formal-grammars
Computational Complexity and P vs. NP, A New Insight
complexity-theory
turing-machines
np-complete
proof-techniques
p-vs-np
i need to know the flowchart for the following turing mechine problem
turing-machines
Simulating Turing Machine with writing only on non-input fields on read-only Turing machine
complexity-theory
computability
turing-machines
Is the language below not decidable , if yes , it is then R.E ?
turing-machines
undecidability
semi-decidability
Does closure under union and concatenation imply closure under Kleene star?
formal-languages
turing-machines
regular-languages
automata
Limited oracle TM
complexity-theory
turing-machines
reductions
space-complexity
oracle-machines
Comparing non-deterministic and also the deterministic expressive power of FA, PDA's and TM'S
turing-machines
finite-automata
computation-models
pushdown-automata
nondeterminism
Church-Turing Thesis and computational power of neural networks
computability
turing-machines
church-turing-thesis
Computational Irreducibility
complexity-theory
turing-machines
Are all context-sensitive languages decidable?
formal-grammars
turing-machines
undecidability
context-sensitive
How can the set of deciders not recursively enumerable when the set of all Turing Machines is recursively enumerable?
turing-machines
How to compute the language {ww | w ∈ {0,1}*} within a Multitape Turing Machine?
turing-machines
Proof of equivalence of L0 and language accepted by made up machine
computability
turing-machines
Prove that an infinite set is semidecidible
turing-machines
semi-decidability
Unary Turing-unrecognizable language
turing-machines
undecidability
Algorithm to determine if a number is perfect on a Turing Machine
algorithms
turing-machines
decision-problem
integers
Is {< M >| L(M) ∩ (ab)∗ is infinite} in D, SD/D, or not in SD?
computability
turing-machines
undecidability
Is it possible to have a code which cannot be solved by computer
turing-machines
turing-completeness
Difference between Non R.E and Co-R.E
computability
turing-machines
Self-Referential Proof
turing-machines
undecidability
The bounded halting problem is decidable. Why doesn't this conflict with Rice's theorem?
computability
turing-machines
undecidability
rice-theorem
decidability about intersection of regular language and context free language
turing-machines
undecidability
Writing a Turing Machine that convers a number from binary to decimal
turing-machines
base-conversion
decidability about NFA accepting an input
turing-machines
undecidability
Robustness of Turing Machines - 3 dimensional case
turing-machines
simulation
machine-models
Can two deterministic turing-machines avoid each other in a sidewalk?
computability
turing-machines
Turing Machine - Tape Question
turing-machines
Proving a language is undecidable where a Turing Machine never enters its initial state again
turing-machines
reductions
Concatenation of two Turing machines
turing-machines
Is it possible to test if two Turing machines have a common word that both accept?
turing-machines
An infinite decidable language that is a subset of $\overline { A_{TM}}$
computability
turing-machines
undecidability
Using reduction to prove that a given language is not recursively enumerable
computability
turing-machines
enumeration
Decidability of a given language
computability
turing-machines
undecidability
Combining two Turing machines
turing-machines
Computability of a function and decidability
computability
turing-machines
Turing degree incomparable with any countable-ordinal jump of another Turing degree?
computability
turing-machines
Language Accepted by a Turing Machine with a Useless State?
formal-languages
turing-machines
automata
reductions
undecidability
How to show that any computable function is bounded above by Busy Beaver Function?
computability
turing-machines
Show that 0^n1^n is decidable
computability
turing-machines
undecidability
pushdown-automata
How does it demonstrate that the computational model of rewriting is adequate?
computability
turing-machines
lambda-calculus
computation-models
Unrecognizability of HALT
turing-machines
automata
What is decider?
computability
turing-machines
Proving that the set of deciders is not Turing-recognizable
turing-machines
undecidability
Decidability of the TM's computing a non-empty subset of total functions
computability
turing-machines
reductions
undecidability
Showing a problem is decidable
turing-machines
decision-problem
Proving there exists an infinite number of Turing machines is a decidable problem
computability
turing-machines
Construct a TM for $L = \{ M | M$ is a Turing machine with no useless states}
computability
turing-machines
undecidability
Show $USELESS_{TM}=\{ M | M$ is a Turing machine with at least one useless state$\}$ is recursively enumerable?
computability
turing-machines
undecidability
Use Rice's theorm to prove undecidability of $EPSILON_{TM}$
turing-machines
undecidability
rice-theorem
What is the relationship between two definitions of Turing-computability of a partial function?
turing-machines
computable-analysis
What is the explicit definition about the computablity of non-deterministic Turing machine?
computability
turing-machines
nondeterminism
Given a computable function $f$ and a decidable language $L$, is there a Turing machine $M$ such that $M$ both decides $L$ and computes $f$?
computability
turing-machines
computation-models
If $L$ is recursive then so is $L^*$, and vice versa
formal-languages
turing-machines
undecidability
Given a Turing Machine M, are there infinitely many Turing machines that recognize L(M)?
turing-machines
How can I find the center character of a two-tape Turing Machine in n transitions?
formal-languages
turing-machines
Is the Language below decidable?
computability
turing-machines
undecidability
decision-problem
${L^*}$ the Kleene star language is decidable then is $ {L}$ decidable
turing-machines
undecidability
decision-problem
Are empty-set languages recursively enumerable?
formal-languages
turing-machines
Is the set of languages recognized by a Turing machine with an oracle countable?
complexity-theory
turing-machines
oracle-machines
Decidability of CFG that accepts at least one odd length string
computability
turing-machines
context-free
Proving that it is undecidable if a Turing machine accepts a language that is its own reverse
computability
turing-machines
decision-problem
Is there an equivalence between "does this program halt" and "is this sentence provable"?
computability
turing-machines
The 'directionality' of reductions?
computability
turing-machines
reductions
halting-problem
Size of the language accepted by a Turing Machine
computability
turing-machines
Completeness problem of TM
computability
turing-machines
semi-decidability
Is below language recursive?
computability
turing-machines
Is $E_{LBA}$ turing-recognizable?
turing-machines
automata
undecidability
Is it possible to simulate a CPU with software?
algorithms
turing-machines
cpu
What are the examples of trivial and non-trivial properties of language recognized by a Turing machine?
turing-machines
"Any problem whose domain is finite is always Decidable", is true or false?
turing-machines
undecidability
Turing machine accepts two different strings
turing-machines
semi-decidability
Proving Blank-halt to be recursively enumerable through reduction to Halting problem
computability
turing-machines
reductions
halting-problem
Is the complement of the Turing machine equality language not recursively enumerable as well?
computability
turing-machines
undecidability
Turing machine - infinite tape in one or two directions
turing-machines
Non-deterministic limited Turing Machine that recognize the language $P$ of palindromes
turing-machines
nondeterminism
Decidability of {(M,w); M terminates on input w and tape of M is empty after computation}
computability
turing-machines
undecidability
semi-decidability
Can input to a Turing machine be of infinite length?
turing-machines
How to prove that $n^k$ is fully space constructable
turing-machines
space-complexity
Undecidability: writing a symbol on Turing Machine's tape
turing-machines
reductions
undecidability
How to determine the DSPACE class for a given Turing Machine?
complexity-theory
turing-machines
space-complexity
Does a Turing Machine with a 2-dimensional tape recognize RE languages?
computability
turing-machines
Prove that { ⟨M⟩ ∣ ⟨M⟩ ∉ L(M) } is undecidable
computability
turing-machines
undecidability
Behavior of non-deterministic Turing Machines after $t_i$ seconds
turing-machines
nondeterminism
Prove whether this language is (partially) decidable
computability
turing-machines
undecidability
semi-decidability
A question on oracle turing machines
complexity-theory
turing-machines
oracle-machines
Non-deterministic Turing Machine recognizing a context-free Language
formal-languages
turing-machines
nondeterminism
algorithm-design
Non-deterministic 2-tape Turing Machine that recognizes palindromes in linear time
turing-machines
nondeterminism
How many tapes would Turing Machine require to find the sum of 2 integers (expressed in base2)?
turing-machines
Reduce Turing Machine
computability
turing-machines
reductions
A two-tape deterministic Turing machine that recognizes an exponential string
computability
turing-machines
Deciding on decidability of a problem and reducing it to halting problem if not decidable
turing-machines
undecidability
semi-decidability
Does rice theorem applies to languages only or does it apply to machines as well?
formal-languages
turing-machines
Constructing a decider for a language
computability
turing-machines
undecidability
closure-properties
$m/p$-equivalence holds after union with an arbitrary finite language
complexity-theory
formal-languages
turing-machines
reductions
polynomial-time
What is the relationship between oracle Turing machine $M^O$ and Turing machine $M$ (given $O$)?
turing-machines
nondeterminism
oracle-machines
space heirarchy and diagonalization
turing-machines
space-complexity
Deterministic finite automata that accepts the only the string "aabb"
turing-machines
automata
finite-automata
Showing that the language $L = \{\langle M, w \rangle\ |\ M$ moves left at least three times while computing $w \}$ is decidable or undecidable
turing-machines
undecidability
semi-decidability