On Almost Everywhere Complex Recursive Functions

DOI10.1145/321832.321840zbMATH Open0315.68038OpenAlexW1986019457MaRDI QIDQ4076767FDOQ4076767

Authors: John Gill, Manuel Blum 

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321840

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (4)

• The complexity of total order structures
• Title not available (Why is that?)
• A note on the best-case complexity
• A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes

This page was built for publication: On Almost Everywhere Complex Recursive Functions

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