Complexity Reference: compref26 (BibTex)

Authors: Ausiello,G

Year: 1971

Title: Abstract Computational Complexity and Cycling Computations

Journal: Journal of Computer and System Sciences, 5, 118-128

Comments: Introduces a weakening of Blum's Axioms for abstract computational complexity which can include measures that can be finite even when the computations converge.


| Top | Authors | Journals | Years | Keywords | Search | New | Comments |

Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University