Network profile

Dan Brumleve

Reputation

560

581
473
366

2018
2019
2020
2021

Next privilege

1,000 Rep.

See votes

Badges

5

17

Newest

Caucus

Next badge

0/1

Impact

1 post edited

0 helpful flags

114 votes cast

8 Bookmarks

Votes Activity Newest Views Added

37

votes

3

answers

6k

views

Extended Church-Turing Thesis

soft-question lo.logic church-turing-thesis

Dec 3 '17 at 22:32 Dan Brumleve 560

31

votes

6

answers

2k

views

Is there a natural problem on the naturals that is NP-complete?

cc.complexity-theory np-hardness nt.number-theory combinatorial-game-theory

May 23 '19 at 23:20 Igor Pak 720

28

votes

2

answers

1k

views

Can we not output the Kolmogorov complexity?

cc.complexity-theory kolmogorov-complexity universal-computation universal-turing-machines

Feb 18 '16 at 4:24 Community♦ 1

19

votes

2

answers

514

views

Is it possible to encrypt a CNF?

cc.complexity-theory cr.crypto-security one-way-function cryptojacking

Feb 10 '18 at 19:26 Mohammad Al-Turkistany 20.2k

13

votes

2

answers

696

views

Reference for Levin's optimal factoring algorithm ?

ds.algorithms reference-request factoring

Apr 28 '11 at 15:46 Hsien-Chih Chang 張顯之 7,428

12

votes

1

answer

412

views

Which complexity class does this number theory problem belong to?

ds.algorithms complexity-classes reductions nt.number-theory np-complete

Aug 14 '15 at 13:32 Manu 7,359

10

votes

4

answers

511

views

Is there a notion of computability on sets other than the natural numbers?

computability

Jun 9 '19 at 6:34 Community♦ 1

5

votes

3

answers

448

views

Natural NP-complete problems with high density?

cc.complexity-theory ds.algorithms complexity-classes np

Dec 2 '15 at 2:44 Community♦ 1

Theoretical Computer Science Stack Exchange works best with JavaScript enabled