Search Results
| 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 computability-theory
Search options not deleted
user 46175
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.
-3
votes
3
answers
337
views
Can we decide whenever a function is the derivate of another function in this Language?
Our EXP functions are made in the following way:
Any constant $ \in \Bbb R$ is a EXP
$X \in \Bbb R$ is a EXP
$sin( g(x))$, $cos( g(x))$ are in EXP if $g(x)$ is a EXP
$tan( g(x))$ is a EXP if $g(x …
CommunityBot
- 1
0
votes
Is there an algorithm that can "reverse engineer" a Regular Expression?
You can only do that under 2 assumptions:
You know ahead the lenght of the regular expression
You can compare the execution tree of a black-box attemp with any previous attemp
As you know regular …
