Is there a black box method to detect if a sorting algorithm is stable?...

What's a Turing machine?...

What are all known languages that Turing machines cannot accept?...

Why can Conway’s Game of Life be classified as a universal machine?...

How to define a function with Church numerals in lambda-terms?...

Proving the inexpressibility of a function in a given language...

proving that a language is part of a grammar and vice versa...

How do you prove whether a simple unmeaningful code is computable or not?...

What is the most concise way to generate strings of language anbncn using JavaScript without using l...

Turing machines and decidability...

Determining a program's execution time by its length in bits?...

Emulating numerical operations in software...

Something is not computable, can it be co-recursively enumerable?...

Why is chess, checkers, Go, etc. in EXP but conjectured to be in NP?...

Why is it assumpted that the time-complexity of multiplication by n is constant?...

Let T = {<M> | M is a TM that accepts $w^R$ whenever it accepts w}. Show that T is undecidable...

program to reproduce itself and be useful -- not a quine...

Can a program decide whether an arbitrary program halts for SOME input?...

Does there exist an algorithm that can solve Vim Golf problems...

What is the "trick" to writing a Quine?...

Subset sum where the size of the subset is `k` is NPC?...

Is the Reduction function a correspondence?...

Ways to measure bit sequence complexity...

Lehmer's extended GCD algorithm implementation...

Turing completeness of lambda calculus?...

Prove that all non-recursive languages are infinite...

To prove something is NP-hard, why do you need to reduce to it from an NP-complete?...

Decidability and Recursive Enumerability...

Understanding Σ* and Σ in formal languages...

jquery not working well on IE8...