Santa Fe Institute Collaboration Platform

Thermodynamics of Computation

Are Recursion Theoretic Arguments Useful in Complexity Theory?

From Thermodynamics of Computation

Revision as of 20:30, April 17, 2018 by Wikiworks (talk | contribs) (CSV import Computer Science Theory)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

reference groups: Computer Science Theory
author-supplied keywords
keywords
authors: Wolfgang Maass
title: Are Recursion Theoretic Arguments Useful in Complexity Theory?
type: journal
year: 1986
source: Studies in Logic and the Foundations of Mathematics
pages: 141-158
volume: 114
issue: C
link: https://www.mendeley.com/catalogue/1dc3f33c-b6c6-3f21-9ba6-1bbe3567cb2e/(Error!"Error!" is not a number.)

Counts

Citation count: 1
Page views: 0

Identifiers

doi: 10.1016/S0049-237X(09)70690-1 (Google search)
issn: 0049237X
sgr: 77956955127
scopus: 2-s2.0-77956955127
pui: 403892284

Retrieved from "https://centre.santafe.edu/thermocomp/w/index.php?title=Are_Recursion_Theoretic_Arguments_Useful_in_Complexity_Theory%3F&oldid=3296"

Reference Materials