TechQA.

Question

I have two types that should be semantically identical. Why is one resulting in an error while the other one gets accepted?

score 49 · Answer 1 · 2024-03-25T17:09:39.157000

0

Answer

49

Views

I have two types that should be semantically identical. Why is one resulting in an error while the other one gets accepted?

49 views Asked by Blue Nebula At 25 March 2024 at 17:09

score 163 · Answer 2 · 2022-12-01T16:19:05.043000

Applying Reflexivity of String Equivalence in Agda Proofs

163 views Asked by PaulProgrammerNoob At 01 December 2022 at 16:19

score 250 · Answer 3 · 2022-03-15T13:40:39.303000

Are linear problems on rational numbers decidable in Z3?

250 views Asked by Shenkok Kotoro At 15 March 2022 at 13:40

score 366 · Answer 4 · 2021-11-24T12:49:26.060000

Z3: is Nonlinear integer arithmetic undecidable or semi-decidable

366 views Asked by Theo Deep At 24 November 2021 at 12:49

score 173 · Answer 5 · 2021-11-03T06:48:40.957000

Is "less than" for rational numbers decideable in Coq?

173 views Asked by LogicChains At 03 November 2021 at 06:48

score 1633 · Answer 6 · 2021-10-19T12:53:34.090000

Prove that we can decide whether a Turing machine takes at least 100 steps on some input

1.6k views Asked by Ananya Nayak At 19 October 2021 at 12:53

score 302 · Answer 7 · 2021-07-07T22:20:06.033000

Recognizabilty of a set in regards to their size bounds

302 views Asked by DazedAndConfused At 07 July 2021 at 22:20

score 785 · Answer 8 · 2021-07-07T14:09:35.467000

Recursive vs recursively enumerable language in Turing Machines?

785 views Asked by lee2020 At 07 July 2021 at 14:09

score 135 · Answer 9 · 2021-07-07T03:07:27.187000

Undecidable if TM overwrites its input?

135 views Asked by InfiniteLoop At 07 July 2021 at 03:07

score 80 · Answer 10 · 2021-03-09T16:25:47.463000

Looking for the Agda module that contains decidable equality for lists

80 views Asked by user1023733 At 09 March 2021 at 16:25

score 734 · Answer 11 · 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 486 · Answer 12 · 2020-11-25T07:08:04.673000

Is a given TM having finite states is decidable or not?

486 views Asked by Viraat Saxsena At 25 November 2020 at 07:08

score 680 · Answer 13 · 2020-11-21T18:34:44.677000

reduction from ALLtm to Etm

680 views Asked by Dan At 21 November 2020 at 18:34

score 146 · Answer 14 · 2020-10-14T23:36:26.480000

How to define a subformula of an inductively defined type in Agda?

146 views Asked by AudioBubble At 14 October 2020 at 23:36

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 3264 · Answer 16 · 2020-05-29T10:32:53.420000

Can a PDA with two stacks accept RE Language?

3.2k views Asked by Q Tw At 29 May 2020 at 10:32

score 150 · Answer 17 · 2020-04-14T13:40:12.563000

Working within agda's decideability framework

150 views Asked by AudioBubble At 14 April 2020 at 13:40

score 166 · Answer 18 · 2020-03-30T00:40:29.067000

What is the prefix of L={⟨M⟩ | M is TM that accepts every palindrome over its alphabet }?

166 views Asked by Michael At 30 March 2020 at 00:40

score 82 · Answer 19 · 2020-03-12T12:22:20.420000

Is OWL2 + SWRL math built ins decidable?

82 views Asked by quarky At 12 March 2020 at 12:22

score 1983 · Answer 20 · 2020-02-11T19:59:11.930000

Proving A Language Is Undecidable Using Turing Reductions

1.9k views Asked by kmoney22z At 11 February 2020 at 19:59

TechQA.

List Question

I have two types that should be semantically identical. Why is one resulting in an error while the other one gets accepted?

Applying Reflexivity of String Equivalence in Agda Proofs

Are linear problems on rational numbers decidable in Z3?

Z3: is Nonlinear integer arithmetic undecidable or semi-decidable

Is "less than" for rational numbers decideable in Coq?

Prove that we can decide whether a Turing machine takes at least 100 steps on some input

Recognizabilty of a set in regards to their size bounds

Recursive vs recursively enumerable language in Turing Machines?

Undecidable if TM overwrites its input?

Looking for the Agda module that contains decidable equality for lists

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

Is a given TM having finite states is decidable or not?

reduction from ALLtm to Etm

How to define a subformula of an inductively defined type in Agda?

Turing machines and decidability

Can a PDA with two stacks accept RE Language?

Working within agda's decideability framework

What is the prefix of L={⟨M⟩ | M is TM that accepts every palindrome over its alphabet }?

Is OWL2 + SWRL math built ins decidable?

Proving A Language Is Undecidable Using Turing Reductions

Popular Questions

Trending Questions