Network profile

44701

Reputation

459

479
394
309

2018
2019
2020
2021

Top tag

computability

Next privilege

500 Rep.

Access review queues

Badges

2

9

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

6 votes cast

12 Questions

Votes Activity Newest Views

2

9

votes

3

answers

650

views

Relationship of algorithm complexity and automata class

complexity-theory automata reference-request complexity-classes

Feb 6 '16 at 13:32 Raphael♦ 69.4k

1

7

votes

2

answers

389

views

primitive recursive functional equivalence

computability decision-problem primitive-recursion

May 15 '17 at 14:39 cody 7,558

3

5

votes

2

answers

484

views

Decidability of dependent typing on primitive recursive languages

computability undecidability type-checking dependent-types primitive-recursion

Sep 16 at 4:32 ComFreek 384

2

4

votes

1

answer

94

views

Maximal class for which function equivalence is decidable

computability complexity-classes decision-problem computation-models

Mar 9 '16 at 12:21 Raphael♦ 69.4k

2

votes

1

answer

530

views

primitive recursion in the lambda calculus

recursion lambda-calculus primitive-recursion

Jan 23 '16 at 13:52 Yuval Filmus 249k

2

votes

1

answer

169

views

primitive recursion on untyped lambda calculus

lambda-calculus primitive-recursion

Jan 14 '16 at 18:29 cody 7,558

1

vote

1

answer

119

views

Calculi for a computability class

computability finite-automata formal-grammars programming-languages pushdown-automata

Feb 6 '16 at 21:10 Yuval Filmus 249k

1

vote

1

answer

860

views

Equivalence of regular grammars

computability regular-languages formal-grammars decision-problem

Feb 6 '16 at 13:22 Raphael♦ 69.4k

1

1

vote

1

answer

110

views

Recognizing primitive recursion

lambda-calculus primitive-recursion church-numerals static-analysis

Jan 25 '16 at 22:30 Community♦ 1

1

vote

1

answer

46

views

Minimal class of grammar required to run program

complexity-theory computability turing-machines formal-grammars

Jan 10 '16 at 12:42 Yuval Filmus 249k

0

votes

1

answer

99

views

Relation of deterministic push down automata and lower elementary recursion

complexity-theory automata pushdown-automata computation-models polynomial-time

Mar 9 '16 at 4:36 D.W.♦ 130k

2

0

votes

1

answer

73

views

Given a λ-term, can I decide which machine model I need to express it?

computability turing-machines lambda-calculus turing-completeness

Jan 11 '16 at 9:35 Community♦ 1

Computer Science Stack Exchange works best with JavaScript enabled