Question

Ways to measure bit sequence complexity

score 186 · Answer 1 · 2015-06-19 20:27:19

186

Views

Ways to measure bit sequence complexity

Published on 19 June 2015 at 20:27

score 971 · Answer 2 · 2014-11-15 20:35:07

971

Views

Does there exist a TM for all countable languages?

Published on 15 November 2014 at 20:35

score 1.5k · Answer 3 · 2014-11-29 17:41:46

1.5k

Views

Turing Machines and Lambda Calculus equivalence

Published on 29 November 2014 at 17:41

score 529 · Answer 4 · 2011-02-16 15:29:59

529

Views

Is poly-time functions class recursively enumerable?

Published on 16 February 2011 at 15:29

score 11.4k · Answer 5 · 2012-01-15 20:10:49

11.4k

Views

What is the "trick" to writing a Quine?

Published on 15 January 2012 at 20:10

score 272 · Answer 6 · 2012-01-23 04:29:18

272

Views

program to reproduce itself and be useful -- not a quine

Published on 23 January 2012 at 04:29

score 389 · Answer 7 · 2012-02-04 10:27:33

389

Views

NP optimization problems (definition)

Published on 04 February 2012 at 10:27

score 506 · Answer 8 · 2014-12-14 20:17:44

506

Views

Recursively enumerable (computably enumerable) languages closed under permutation?

Published on 14 December 2014 at 20:17

score 71 · Answer 9 · 2020-12-13 21:16:07

71

Views

Proving the inexpressibility of a function in a given language

Published on 13 December 2020 at 21:16

score 32 · Answer 10 · 2018-11-09 13:26:45

32

Views

What does it mean to pass the machine and it's description as the input in the halting problem?

Published on 09 November 2018 at 13:26

score 8.4k · Answer 11 · 2018-11-13 09:37:24

8.4k

Views

REGEX L(r) = {a^n b^m : n + m is even}, r =?

Published on 13 November 2018 at 09:37

score 114 · Answer 12 · 2018-11-13 23:15:22

114

Views

Does my solution show that the language is uncomputable by applying rice's theorem?

Published on 13 November 2018 at 23:15

score 147 · Answer 13 · 2013-08-08 11:17:28

147

Views

Where can I find good explanations of Computability and Complexity?

Published on 08 August 2013 at 11:17

score 185 · Answer 14 · 2013-08-21 19:53:37

185

Views

Deciding inhabitation?

Published on 21 August 2013 at 19:53

score 636 · Answer 15 · 2012-07-27 15:09:01

636

Views

Understanding Σ* and Σ in formal languages

Published on 27 July 2012 at 15:09

score 109 · Answer 16 · 2022-12-13 00:27:40

109

Views

Can we assure a strictly decreasing function is computable?

Published on 13 December 2022 at 00:27

score 67 · Answer 17 · 2020-07-25 17:02:06

67

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 445 · Answer 18 · 2014-06-01 13:35:26

445

Views

Is it possible to create an algorithm which generates an autogram?

Published on 01 June 2014 at 13:35

score 683 · Answer 19 · 2021-02-02 09:25:34

683

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 694 · Answer 20 · 2022-05-16 14:51:42

694

Views

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

Published on 16 May 2022 at 14:51

List Question

Ways to measure bit sequence complexity

Does there exist a TM for all countable languages?

Turing Machines and Lambda Calculus equivalence

Is poly-time functions class recursively enumerable?

What is the "trick" to writing a Quine?

program to reproduce itself and be useful -- not a quine

NP optimization problems (definition)

Recursively enumerable (computably enumerable) languages closed under permutation?

Proving the inexpressibility of a function in a given language

What does it mean to pass the machine and it's description as the input in the halting problem?

REGEX L(r) = {a^n b^m : n + m is even}, r =?

Does my solution show that the language is uncomputable by applying rice's theorem?

Where can I find good explanations of Computability and Complexity?

Deciding inhabitation?

Understanding Σ* and Σ in formal languages

Can we assure a strictly decreasing function is computable?

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

Is it possible to create an algorithm which generates an autogram?

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

Disjunctive Normal Form and satisfiable is in P (DNFSAT)

Trending Questions

Popular # Hahtags

Popular Questions