Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03321OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898841

Peter Peshev, Dimiter Skordev

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

zbMATH Keywords

computable analysiscomputable operatorFundamental theorem of algebraRosenbloom's proofsecond Grzegorczyk class

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (2)

Unnamed Item ⋮ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants

This page was built for publication: Logical Approaches to Computational Barriers