computability-My Code Helper

What's a Turing machine?...

computer-science theory turing-machines computability

What are all known languages t...

theory turing-machines computability

Why can Conway’s Game of Life ...

theory turing-machines turing-complete computability

How to define a function with ...

function lambda-calculus computation-theory church-encoding computability

Proving the inexpressibility o...

programming-languages proof computability

proving that a language is par...

complexity-theory theory formal-languages computability

How do you prove whether a sim...

c computation-theory formal-verification formal-methods computability

What is the most concise way t...

javascript lambda-calculus turing-machines declarative computability

Turing machines and decidabili...

turing-machines decidable computability

Determining a program's ex...

time-complexity collatz code-complexity halting-problem computability

Emulating numerical operations...

numeric computability

Something is not computable, c...

turing-machines computability decidable

Why is chess, checkers, Go, et...

complexity-theory asymptotic-complexity np-complete computability

Why is it assumpted that the t...

algorithm time-complexity computability

Let T = {<M> | M is a TM...

algorithm computer-science complexity-theory turing-machines computability

program to reproduce itself an...

quine computability

Can a program decide whether a...

logic computer-science halting-problem computability

Does there exist an algorithm ...

algorithm vim computer-science halting-problem computability

What is the "trick" ...

quine computability

Subset sum where the size of t...

reduction np np-complete subset-sum computability

Is the Reduction function a co...

complexity-theory computability correspondence

Ways to measure bit sequence c...

performance sequence complexity-theory computation computability

Lehmer's extended GCD algo...

algorithm discrete-mathematics greatest-common-divisor computability

Turing completeness of lambda ...

theory turing-machines turing-complete computability

Prove that all non-recursive l...

recursion theory computability

To prove something is NP-hard,...

notation computability

Decidability and Recursive Enu...

computer-science theory turing-machines computability

Understanding Σ* and Σ in form...

automata formal-languages computability

jquery not working well on IE8...

jquery internet-explorer computability

Sticky footer not working in I...

css internet-explorer css-position computability