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.

MaRDI QIDQ1780969zbMATH OpenFDO

Authors

Publication date 15 June 2005

Published in Trends in Logic -- Studia Logica Library (Search for Journal in Brave)

Mathematics Subject Classification ID

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)

Recommendations

• Fine hierarchies and m-reducibilities in theoretical computer science
• Infinite time Turing machines
• Logical Approaches to Computational Barriers
• scientific article; zbMATH DE number 3952713
• Infinite Computations and a Hierarchy in Δ 3

Cited in

(3)

• Axiomatizability of representable domain algebras
• Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems
• 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

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.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780969)