Classical and new paradigms of computation and their complexity hierarchies. Papers of the conference ``Foundations of the formal sciences III, Vienna, Austria, September 21-24, 2001.
From MaRDI portal
Publication:1780969
zbMath1104.68506MaRDI QIDQ1780969
No author found.
Publication date: 15 June 2005
Published in: Trends in Logic -- Studia Logica Library (Search for Journal in Brave)
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Axiomatizability of representable domain algebras ⋮ History and philosophy of infinity. Selected papers from the conference ``Foundations of the Formal Sciences VIII held at Corpus Christi College, Cambridge, England, 20--23 September 2013 ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
This page was built for publication: Classical and new paradigms of computation and their complexity hierarchies. Papers of the conference ``Foundations of the formal sciences III, Vienna, Austria, September 21-24, 2001.
