Question

Computable homotopy?

score 79 · Answer 1 · 2019-06-29 21:24:32

79

Views

Computable homotopy?

Published on 29 Jun 2019 - 21:24

score 192 · Answer 2 · 2026-03-25 12:30:37

192

Views

Can optimization version problem whose decision version is NP-complete be solved in poly-time iff P=NP?

Published on 25 Mar 2026 - 12:30

score 62 · Answer 3 · 2026-03-25 07:52:09

62

Views

Prove that a function defined recursively exists.

Published on 25 Mar 2026 - 7:52

score 52 · Answer 4 · 2026-03-25 20:08:30

52

Views

$\text{LOOP-EVEN}_{TM}$ = {M is a TM that won't halt for every EVEN input} why is $\text{LOOP-EVEN}^\complement$ recognisable?

Published on 25 Mar 2026 - 20:08

score 574 · Answer 5 · 2026-03-25 20:13:55

574

Views

A is an NP-Complete language, B is a language in P, prove that A∪B is NP-Complete

Published on 25 Mar 2026 - 20:13

score 102 · Answer 6 · 2026-03-25 11:00:49

102

Views

Goedel's representability of simple recursive sets

Published on 25 Mar 2026 - 11:00

score 1.1k · Answer 7 · 2026-02-23 04:55:27

1.1k

Views

Decide Whether or Not These Questions are Decidable and Substantiate Your Answers

Published on 23 Feb 2026 - 4:55

score 189 · Answer 8 · 2019-07-13 17:31:58

189

Views

Relationship between quine-like and diagonalization proofs of Rogers fixed point theorem?

Published on 13 Jul 2019 - 17:31

score 207 · Answer 9 · 2026-03-25 06:21:06

207

Views

Does ATR0 prove existence of uncomputable well-ordering?

Published on 25 Mar 2026 - 6:21

score 29 · Answer 10 · 2026-03-25 12:50:12

29

Views

Importance of predicates similar to the form $(Ex)(y)R(a_1,...,a_n,x,y)$ where $R$ is general recursive

Published on 25 Mar 2026 - 12:50

score 190 · Answer 11 · 2019-07-17 17:40:58

190

Views

Is it possible to define such a set that contains countable many computable and countable many non-computable infinite sequences?

Published on 17 Jul 2019 - 17:40

score 69 · Answer 12 · 2019-07-23 06:35:03

69

Views

Is it possible to define an unique operation $\varphi$, which transforms a computable function into a non computable function?

Published on 23 Jul 2019 - 6:35

score 73 · Answer 13 · 2026-03-25 21:53:24

73

Views

equivalent $NFA$s

Published on 25 Mar 2026 - 21:53

score 50 · Answer 14 · 2019-07-26 21:30:11

50

Views

A semi non-computable function?

Published on 26 Jul 2019 - 21:30

score 50 · Answer 15 · 2019-07-27 04:26:43

50

Views

Under which conditions does the non-computable infinite sequences have a computable subsequences?

Published on 27 Jul 2019 - 4:26

List Question

Computable homotopy?

Can optimization version problem whose decision version is NP-complete be solved in poly-time iff P=NP?

Prove that a function defined recursively exists.

$\text{LOOP-EVEN}_{TM}$ = {M is a TM that won't halt for every EVEN input} why is $\text{LOOP-EVEN}^\complement$ recognisable?

A is an NP-Complete language, B is a language in P, prove that A∪B is NP-Complete

Goedel's representability of simple recursive sets

Decide Whether or Not These Questions are Decidable and Substantiate Your Answers

Relationship between quine-like and diagonalization proofs of Rogers fixed point theorem?

Does ATR0 prove existence of uncomputable well-ordering?

Importance of predicates similar to the form $(Ex)(y)R(a_1,...,a_n,x,y)$ where $R$ is general recursive

Is it possible to define such a set that contains countable many computable and countable many non-computable infinite sequences?

Is it possible to define an unique operation $\varphi$, which transforms a computable function into a non computable function?

equivalent $NFA$s

A semi non-computable function?

Under which conditions does the non-computable infinite sequences have a computable subsequences?

Trending Questions

Popular # Hahtags

Popular Questions