The following pages link to Algorithmic Procedures (Q4018437):
Displayed 8 items.
- A difference in complexity between recursion and tail recursion (Q519902) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220) (← links)
- Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\) (Q1683704) (← links)
- The Irrationals are not Recursively Enumerable (Q3487334) (← links)
- Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Feferman on Computability (Q5214780) (← links)