Profile Activity

swarnim_narayan

Network profile

Reputation

474

474
379
284

2016
2017
2018
2019

Top tag

algorithm-analysis

Next privilege

500 Rep.

Access review queues

Badges

2

9

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

7 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

7 Favorites

Added Views Newest Activity Votes

22

votes

2

answers

932

views

Theoretical foundations of Divide and Conquer

algorithms reference-request divide-and-conquer

Jan 27 '14 at 13:03 Cornelius Brand 1,279

6

votes

1

answer

346

views

Is the memory-runtime tradeoff an equivalent of Heisenberg's uncertainty principle?

algorithms time-complexity space-complexity performance

Aug 8 '13 at 10:40 Community♦ 1

28

votes

2

answers

580

views

How to efficiently determine whether a given ladder is valid?

algorithms graphs

Jun 26 '16 at 16:46 Ben 399

3

votes

2

answers

140

views

Is there an algorithm which can compute every algorithm's time complexity?

computability time-complexity

Jul 10 '13 at 8:03 Community♦ 1

1

vote

3

answers

1k

views

Why every finite set is computable?

computability turing-machines

Jul 12 '13 at 5:55 Community♦ 1

132

votes

3

answers

14k

views

How can it be decidable whether $\pi$ has some sequence of digits?

computability undecidability

Apr 23 at 11:02 David Richerby 76.1k

7

votes

2

answers

390

views

To what does typing correspond in a Turing Machine?

turing-machines lambda-calculus type-theory church-turing-thesis

Jul 9 '13 at 3:05 Community♦ 1

Computer Science Stack Exchange works best with JavaScript enabled