Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 37726

computable sets and functions, Turing degrees, c.e. degrees, models of computability, primitive recursion, oracle computation, models of computability, decision problems, undecidability, Turing jump, halting problem, notions of computable randomness, computable model theory, computable equivalence relation theory, arithmetic and hyperarithmetic hierarchy, infinitary computability, $\alpha$-recursion, complexity theory.

6 votes
1 answer
202 views

Finite-variable fragments of $\Delta_0$-formulas

Consider sets definable in the usual structure of arithmetic $(\mathbb{N},0,1,+,\times)$ by $\Delta_0$-formulas, i.e., formulas with bounded quantifiers. The quantifier alternation hierarchy has been …
Siddharth's user avatar
  • 211
1 vote
0 answers
29 views

Can a positive elementary inductive definition refer to its own stage comparison relation?

This is a cross-post of a question from cstheory.SE Moschovakis' stage comparison theorem says that the stage comparison relation associated with any positive elementary induction is itself definable …
Siddharth's user avatar
  • 211
1 vote

Transfinite algorithms

In this paper Jay Kienzle and I consider traversal algorithms over infinite, well-ordered graphs. The situation is a little different than your conditions (1)-(3): the algorithms are deterministic and …
Siddharth's user avatar
  • 211