StackOverflow Questions for Tag: computability

forivall

Reputation: 9913

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

javascriptsortingcomputer-sciencecomputability

Score: 17

Answers: 6

Suleyman Kiani

Reputation: 27

Prove that the following problem is undecidable by a reduction from the halting problem:

discrete-mathematicscomputation-theoryturing-machinesautomata-theorycomputability

Score: 0

Answers: 1

Pol

Reputation: 13

Can we assure a strictly decreasing function is computable?

turing-machinescomputationcomputability

Score: 1

Answers: 1

Neil Zhang

Reputation: 11

Why do we define equivalent turing machines as two turing machines with the same accepted languages?

logiccomputation-theoryturing-machinescomputability

Score: 1

Answers: 1

Roger Costello

Reputation: 3209

An infinite language can't be regular? What is a finite language?

regular-languagefinite-automataformal-languagescomputabilitykleene-star

Score: 12

Answers: 4

Greg Peckory

Reputation: 8068

Turing Machines and Lambda Calculus equivalence

functional-programminglambda-calculusturing-machinescomputability

Score: 1

Answers: 2

Claudiu

Reputation: 229561

What's a Turing machine?

computer-sciencetheoryturing-machinescomputability

Score: 48

Answers: 11

Rose Perrone

Reputation: 63586

What are all known languages that Turing machines cannot accept?

theoryturing-machinescomputability

Score: 9

Answers: 2

ili

Reputation: 216

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

computer-sciencecomputation-theorycomputability

Score: 0

Answers: 1

Musher Soccoli

Reputation: 149

Equality between two propositions nat -> nat

coqequalitycomputation-theoryfind-occurrencescomputability

Score: 1

Answers: 2

user7821248

Reputation:

Make the assumption that P = NP

graph-theorynpnp-hardcomputability

Score: 2

Answers: 1

Robin Andrews

Reputation: 3804

Inputs to Program to Illustrate Halting Problem

computabilityhalting-problem

Score: 1

Answers: 1

Ziggy

Reputation: 22385

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

theoryturing-machinesturing-completecomputability

Score: 71

Answers: 5

solnay

Reputation: 29

REGEX L(r) = {a^n b^m : n + m is even}, r =?

regexmathautomataformal-languagescomputability

Score: 0

Answers: 2

Luka Fürst

Reputation: 73

"Reduction" from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)

computation-theoryturing-machinesreductiondecidablecomputability

Score: 1

Answers: 1

user3351676

Reputation: 91

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

functionlambda-calculuscomputation-theorychurch-encodingcomputability

Score: 1

Answers: 1

user3351676

Reputation: 91

How to define a coding function for all finite subsets of N?

functioncomputation-theorycomputabilitycountable

Score: 1

Answers: 1

Ben

Reputation: 65

Proving the inexpressibility of a function in a given language

programming-languagesproofcomputability

Score: 1

Answers: 2

rem208

Reputation: 79

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

complexity-theorytheoryformal-languagescomputability

Score: 0

Answers: 1

Lorale

Reputation: 123

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

ccomputation-theoryformal-verificationformal-methodscomputability

Score: 0

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: computability

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

Prove that the following problem is undecidable by a reduction from the halting problem:

Can we assure a strictly decreasing function is computable?

Why do we define equivalent turing machines as two turing machines with the same accepted languages?

An infinite language can&#39;t be regular? What is a finite language?

Turing Machines and Lambda Calculus equivalence

What&#39;s a Turing machine?

What are all known languages that Turing machines cannot accept?

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

Equality between two propositions nat -&gt; nat

Make the assumption that P = NP

Inputs to Program to Illustrate Halting Problem

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

REGEX L(r) = {a^n b^m : n + m is even}, r =?

&quot;Reduction&quot; from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)

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

How to define a coding function for all finite subsets of N?

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?

An infinite language can't be regular? What is a finite language?

What's a Turing machine?

Equality between two propositions nat -> nat

"Reduction" from the complement of the universal language (L_u) to the language of nonempty-language Turing machines (L_ne)