TechQA.

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

0

Answer

109

Views

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

109 views Asked by Suleyman Kiani At 17 April 2023 at 06:41

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

Can we assure a strictly decreasing function is computable?

162 views Asked by Pol At 13 December 2022 at 00:27

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

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

411 views Asked by Neil Zhang At 02 November 2022 at 03:55

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

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

742 views Asked by ili At 16 May 2022 at 14:51

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

Make the assumption that P = NP

73 views Asked by AudioBubble At 16 December 2021 at 00:11

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

Equality between two propositions nat -> nat

114 views Asked by Musher Soccoli At 23 November 2021 at 15:20

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

Inputs to Program to Illustrate Halting Problem

156 views Asked by Robin Andrews At 29 August 2021 at 16:30

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

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

734 views Asked by Luka Fürst At 02 February 2021 at 09:25

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

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

298 views Asked by user3351676 At 22 December 2020 at 07:36

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

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

221 views Asked by user3351676 At 22 December 2020 at 00:18

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

Proving the inexpressibility of a function in a given language

141 views Asked by Ben At 13 December 2020 at 21:16

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

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

687 views Asked by rem208 At 17 November 2020 at 17:30

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

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

440 views Asked by Lorale At 13 November 2020 at 10:22

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

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

104 views Asked by Benjamin Paige At 25 July 2020 at 17:02

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

Turing machines and decidability

489 views Asked by jbushi At 23 June 2020 at 20:29

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

Multiple questions related to Actor-based model

32 views Asked by Francisco Javier At 02 June 2020 at 00:16

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

Automata and Computability

40 views Asked by jimmyb At 08 April 2020 at 22:56

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

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

76 views Asked by AudioBubble At 06 January 2020 at 16:37

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

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

958 views Asked by Ryan Foster At 04 November 2019 at 19:47

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

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

381 views Asked by sharprabbitz At 29 November 2018 at 03:06

TechQA.

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?

Popular Questions

Trending Questions