TechQA.

Question

'try' can decide when a program halts

score 218 · Answer 1 · 2015-06-20 21:24:32

1

Answer

218

Views

'try' can decide when a program halts

218 views Asked by Alon Gurny At 20 June 2015 at 21:24

score 389 · Answer 2 · 2013-12-03 03:53:04

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

389 views Asked by Michael Anthony Leber At 03 December 2013 at 03:53

score 7905 · Answer 3 · 2013-09-10 21:27:06

Determining whether a regex is a subset of another

7.9k views Asked by deft_code At 10 September 2013 at 21:27

score 197 · Answer 4 · 2020-10-15 12:23:55

Is Rice's Theorem equivalent to the Halting problem?

197 views Asked by StuckInTheFridge At 15 October 2020 at 12:23

score 1572 · Answer 5 · 2012-01-14 07:23:22

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

1.5k views Asked by Lion At 14 January 2012 at 07:23

score 465 · Answer 6 · 2013-12-23 00:49:19

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

465 views Asked by user3128178 At 23 December 2013 at 00:49

score 591 · Answer 7 · 2013-12-30 22:53:35

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

591 views Asked by Jens At 30 December 2013 at 22:53

score 338 · Answer 8 · 2020-12-08 22:57:48

Discrete Logarithm in Prolog

338 views Asked by AudioBubble At 08 December 2020 at 22:57

score 1409 · Answer 9 · 2013-08-12 03:02:05

Do agda programs necessarily terminate?

1.4k views Asked by user833970 At 12 August 2013 at 03:02

score 129 · Answer 10 · 2020-07-29 18:42:06

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

129 views Asked by Romil At 29 July 2020 at 18:42

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