Question

Is there an "open sets style" formulation of Topology that makes the connection to semidecidability precise?

score 198 · Answer 1 · 2017-03-26 21:26:11

198

Views

Is there an "open sets style" formulation of Topology that makes the connection to semidecidability precise?

Published on 26 Mar 2017 - 21:26

score 156 · Answer 2 · 2017-03-27 09:40:09

156

Views

Decidability or computability in the class P

Published on 27 Mar 2017 - 9:40

score 421 · Answer 3 · 2026-03-26 17:29:33

421

Views

Godel's Incompleteness Theorem

Published on 26 Mar 2026 - 17:29

score 54 · Answer 4 · 2017-03-29 00:04:53

54

Views

Oracle machines that halt on every input

Published on 29 Mar 2017 - 0:04

score 1.6k · Answer 5 · 2026-03-29 08:35:20

1.6k

Views

How to prove that every computable function has infinitely many indices? [cutland 4.2.3]

Published on 29 Mar 2026 - 8:35

score 18 · Answer 6 · 2026-03-21 01:19:40

18

Views

Could we use evolutionary computation to have a computer create formulas for number sequences?

Published on 21 Mar 2026 - 1:19

score 5.2k · Answer 7 · 2026-03-27 04:22:34

5.2k

Views

Lambda Calculus factorial

Published on 27 Mar 2026 - 4:22

score 56 · Answer 8 · 2017-04-09 08:55:43

56

Views

Subset enumeration by size is not primitive recursive?

Published on 09 Apr 2017 - 8:55

score 103 · Answer 9 · 2026-03-25 06:10:19

103

Views

How does one prove that a programming language can calculate every (computable) real number?

Published on 25 Mar 2026 - 6:10

score 42 · Answer 10 · 2023-02-05 01:14:35

42

Views

Caveat in interpreting many-one reducibility as "computational difficulty"

Published on 05 Feb 2023 - 1:14

score 80 · Answer 11 · 2026-03-27 06:15:33

80

Views

A Computable Forcing Argument

Published on 27 Mar 2026 - 6:15

score 166 · Answer 12 · 2023-02-08 19:46:03

166

Views

Could an analog computer model a non-computable function?

Published on 08 Feb 2023 - 19:46

score 150 · Answer 13 · 2026-03-25 10:55:45

150

Views

Which of these two very large numbers is larger?

Published on 25 Mar 2026 - 10:55

score 48 · Answer 14 · 2026-03-22 17:23:21

48

Views

What is the exact difference that makes Chaitin's number uncomputable while this other number (from another post) computable?

Published on 22 Mar 2026 - 17:23

score 30 · Answer 15 · 2023-03-09 20:45:45

30

Views

Does Roger recursion theorem needs a universal program?

Published on 09 Mar 2023 - 20:45

List Question

Is there an "open sets style" formulation of Topology that makes the connection to semidecidability precise?

Decidability or computability in the class P

Godel's Incompleteness Theorem

Oracle machines that halt on every input

How to prove that every computable function has infinitely many indices? [cutland 4.2.3]

Could we use evolutionary computation to have a computer create formulas for number sequences?

Lambda Calculus factorial

Subset enumeration by size is not primitive recursive?

How does one prove that a programming language can calculate every (computable) real number?

Caveat in interpreting many-one reducibility as "computational difficulty"

A Computable Forcing Argument

Could an analog computer model a non-computable function?

Which of these two very large numbers is larger?

What is the exact difference that makes Chaitin's number uncomputable while this other number (from another post) computable?

Does Roger recursion theorem needs a universal program?

Trending Questions

Popular # Hahtags

Popular Questions