✦ LIBER ✦

Abstract computational complexity and cycling computations

✍ Scribed by Giorgio Ausiello

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 424 KB
Volume: 5
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(71)80030-2

No coin nor oath required. For personal study only.

✦ Synopsis

A weakening of Blum's Axioms for abstract computational complexity is introduced in order to take into a better account measures that can be finite even when the computations diverge. How the new axioms affect the theory and how they can be used to get an insight in the theory of computations using a finite amount of resource, is shown.

📜 SIMILAR VOLUMES

Computational complexity of compaction t

Computational complexity of compaction to irreflexive cycles

✍ Narayan Vikas 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 295 KB

In this paper, we solve a long-standing problem that has been of interest since about 1988. The problem in general is to decide whether or not it is possible to partition the vertices of a graph into k distinct non-empty sets A 0 ; A 1 ; y; A kÀ1 ; such that the vertices in A i are independent and t

Rationality, computability, and complexi

Rationality, computability, and complexity

✍ Berc Rustem; Kumaraswamy Velupillai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Computational complexity on computable m

Computational complexity on computable metric spaces

✍ Klaus Weirauch 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

## Abstract We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko [19] et al. Although this definition of TIME as the maximum of a gene

Computer modelling of cycling technique

✍ Peter Sinclair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Complexity of network reliability comput

Complexity of network reliability computations

✍ Michael O. Ball 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 614 KB

Automatic analysis of computed catalytic

Automatic analysis of computed catalytic cycles

✍ Andreas Uhe; Sebastian Kozuch; Sason Shaik 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract The energetic span model allows the estimation of the turnover frequency (TOF) of a catalytic reaction from its calculated energy profile. Furthermore, by identifying the TOF determining intermediate and the TOF determining transition state, the model shows that the concept of “determin