Question

When is the $\mu$ operator a partial function vs. total?

score 229 · Answer 1 · 2026-02-23 04:51:17

229

Views

When is the $\mu$ operator a partial function vs. total?

Published on 23 Feb 2026 - 4:51

score 478 · Answer 2 · 2026-03-28 07:48:19

478

Views

Are all simply typed lambda terms of type $(A\to A) \to A \to A$ church numerals?

Published on 28 Mar 2026 - 7:48

score 91 · Answer 3 · 2017-11-19 20:22:43

91

Views

Showing that a function is primitive recursive

Published on 19 Nov 2017 - 20:22

score 144 · Answer 4 · 2017-11-19 21:14:18

144

Views

Show that the set of provable sentences is decidable.

Published on 19 Nov 2017 - 21:14

score 425 · Answer 5 · 2026-03-29 10:08:02

425

Views

How do we show that Rado's function (for the Busy Beaver Algorithm) is non-computable?

Published on 29 Mar 2026 - 10:08

score 47 · Answer 6 · 2017-11-29 20:06:42

47

Views

Optimisation Problem involving sorting Vectors

Published on 29 Nov 2017 - 20:06

score 339 · Answer 7 · 2026-03-29 08:20:59

339

Views

Compute any real number, given an uncountable set of real numbers?

Published on 29 Mar 2026 - 8:20

score 113 · Answer 8 · 2026-03-29 08:13:36

113

Views

How to do reduction?

Published on 29 Mar 2026 - 8:13

score 69 · Answer 9 · 2026-03-29 08:13:26

69

Views

Reductions: Turing Machines

Published on 29 Mar 2026 - 8:13

score 262 · Answer 10 · 2017-12-08 05:59:49

262

Views

Mathematical problems that are too computationally complex, so we use probability distributions instead?

Published on 08 Dec 2017 - 5:59

score 121 · Answer 11 · 2017-12-09 00:14:45

121

Views

Enumerating all halting programs

Published on 09 Dec 2017 - 0:14

score 65 · Answer 12 · 2017-12-10 18:22:58

65

Views

Is this diagonalization argument correct?

Published on 10 Dec 2017 - 18:22

score 668 · Answer 13 · 2017-12-13 09:09:16

668

Views

Is this a good way to understand the uncountability of uncomputable numbers (and the countability of the computables)?

Published on 13 Dec 2017 - 9:09

score 489 · Answer 14 · 2026-03-26 12:57:56

489

Views

Computable extension to $Σ_1$-sound system that is $Σ_2$-unsound?

Published on 26 Mar 2026 - 12:57

score 342 · Answer 15 · 2026-03-28 05:58:42

342

Views

Halting Problem as Incompleteness in Formal System

Published on 28 Mar 2026 - 5:58

List Question

When is the $\mu$ operator a partial function vs. total?

Are all simply typed lambda terms of type $(A\to A) \to A \to A$ church numerals?

Showing that a function is primitive recursive

Show that the set of provable sentences is decidable.

How do we show that Rado's function (for the Busy Beaver Algorithm) is non-computable?

Optimisation Problem involving sorting Vectors

Compute any real number, given an uncountable set of real numbers?

How to do reduction?

Reductions: Turing Machines

Mathematical problems that are too computationally complex, so we use probability distributions instead?

Enumerating all halting programs

Is this diagonalization argument correct?

Is this a good way to understand the uncountability of uncomputable numbers (and the countability of the computables)?

Computable extension to $Σ_1$-sound system that is $Σ_2$-unsound?

Halting Problem as Incompleteness in Formal System

Trending Questions

Popular # Hahtags

Popular Questions