Question

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

score 109 · Answer 1 · 2023-04-17T06:41:27.587000

109

Views

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

Published on 17 April 2023 at 06:41

score 162 · Answer 2 · 2022-12-13T00:27:40.353000

162

Views

Can we assure a strictly decreasing function is computable?

Published on 13 December 2022 at 00:27

score 411 · Answer 3 · 2022-11-02T03:55:24.720000

411

Views

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

Published on 02 November 2022 at 03:55

score 742 · Answer 4 · 2022-05-16T14:51:42.240000

742

Views

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

Published on 16 May 2022 at 14:51

score 73 · Answer 5 · 2021-12-16T00:11:15.917000

73

Views

Make the assumption that P = NP

Published on 16 December 2021 at 00:11

score 114 · Answer 6 · 2021-11-23T15:20:17.787000

114

Views

Equality between two propositions nat -> nat

Published on 23 November 2021 at 15:20

score 156 · Answer 7 · 2021-08-29T16:30:07.767000

156

Views

Inputs to Program to Illustrate Halting Problem

Published on 29 August 2021 at 16:30

score 734 · Answer 8 · 2021-02-02T09:25:34.163000

734

Views

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

Published on 02 February 2021 at 09:25

score 298 · Answer 9 · 2020-12-22T07:36:51.520000

298

Views

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

Published on 22 December 2020 at 07:36

score 221 · Answer 10 · 2020-12-22T00:18:11.057000

221

Views

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

Published on 22 December 2020 at 00:18

score 141 · Answer 11 · 2020-12-13T21:16:07.273000

141

Views

Proving the inexpressibility of a function in a given language

Published on 13 December 2020 at 21:16

score 687 · Answer 12 · 2020-11-17T17:30:18.187000

687

Views

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

Published on 17 November 2020 at 17:30

score 440 · Answer 13 · 2020-11-13T10:22:32.477000

440

Views

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

Published on 13 November 2020 at 10:22

score 104 · Answer 14 · 2020-07-25T17:02:06.373000

104

Views

What is the most concise way to generate strings of language anbncn using JavaScript without using loops?

Published on 25 July 2020 at 17:02

score 489 · Answer 15 · 2020-06-23T20:29:06.720000

489

Views

Turing machines and decidability

Published on 23 June 2020 at 20:29

score 32 · Answer 16 · 2020-06-02T00:16:24.970000

32

Views

Multiple questions related to Actor-based model

Published on 02 June 2020 at 00:16

score 40 · Answer 17 · 2020-04-08T22:56:54.523000

40

Views

Automata and Computability

Published on 08 April 2020 at 22:56

score 76 · Answer 18 · 2020-01-06T16:37:22.300000

76

Views

Determining a program's execution time by its length in bits?

Published on 06 January 2020 at 16:37

score 958 · Answer 19 · 2019-11-04T19:47:44.997000

958

Views

Can a grammar ever be parsed by LL(1) but not with LR(1)?

Published on 04 November 2019 at 19:47

score 381 · Answer 20 · 2018-11-29T03:06:11.923000

381

Views

Something is not computable, can it be co-recursively enumerable?

Published on 29 November 2018 at 03:06

List Question

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?

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

Make the assumption that P = NP

Equality between two propositions nat -> nat

Inputs to Program to Illustrate Halting Problem

"Reduction" 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?

What is the most concise way to generate strings of language anbncn using JavaScript without using loops?

Turing machines and decidability

Multiple questions related to Actor-based model

Automata and Computability

Determining a program's execution time by its length in bits?

Can a grammar ever be parsed by LL(1) but not with LR(1)?

Something is not computable, can it be co-recursively enumerable?

Trending Questions

Popular # Hahtags

Popular Questions