TechQA.

Question

'try' can decide when a program halts

score 230 · Answer 1 · 2025-01-02 05:19:29

1

Answer

230

Views

'try' can decide when a program halts

230 views Asked by Alon Gurny At 02 January 2025 at 05:19

score 391 · Answer 2 · 2024-12-30 21:33:51

How to prove that "Total" is not recursive (decidable)

391 views Asked by Michael Anthony Leber At 30 December 2024 at 21:33

score 7907 · Answer 3 · 2025-01-02 05:22:17

Determining whether a regex is a subset of another

7.9k views Asked by deft_code At 02 January 2025 at 05:22

score 200 · Answer 4 · 2025-01-02 05:22:16

Is Rice's Theorem equivalent to the Halting problem?

200 views Asked by StuckInTheFridge At 02 January 2025 at 05:22

score 1556 · Answer 5 · 2025-01-02 05:22:18

The use of System.currentTimeMillis() in loops in Java

1.5k views Asked by Lion At 02 January 2025 at 05:22

score 467 · Answer 6 · 2025-01-02 05:25:50

Making a function that will identify an infinite loop in existing code

467 views Asked by user3128178 At 02 January 2025 at 05:25

score 596 · Answer 7 · 2025-01-02 05:26:13

Is finding pointers in C/C++ code statically equivalent to the Halting Ρroblem?

596 views Asked by Jens At 02 January 2025 at 05:26

score 349 · Answer 8 · 2025-01-02 05:18:06

Discrete Logarithm in Prolog

349 views Asked by AudioBubble At 02 January 2025 at 05:18

score 1427 · Answer 9 · 2025-01-02 05:19:00

Do agda programs necessarily terminate?

1.4k views Asked by user833970 At 02 January 2025 at 05:19

score 138 · Answer 10 · 2025-01-02 05:25:49

Every np-complete problem reduces to the Halting problem. Is this true?

138 views Asked by Romil At 02 January 2025 at 05:25

TechQA.

List Question

'try' can decide when a program halts

How to prove that "Total" is not recursive (decidable)

Determining whether a regex is a subset of another

Is Rice's Theorem equivalent to the Halting problem?

The use of System.currentTimeMillis() in loops in Java

Making a function that will identify an infinite loop in existing code

Is finding pointers in C/C++ code statically equivalent to the Halting Ρroblem?

Discrete Logarithm in Prolog

Do agda programs necessarily terminate?

Every np-complete problem reduces to the Halting problem. Is this true?

Popular Questions

Popular Tags

Trending Questions