✦ LIBER ✦

The halt problem and theory of hierarchies

✍ Scribed by L. N. Pobedin

Book ID: 105272590
Publisher: Springer US
Year: 1975
Tongue: English
Weight: 890 KB
Volume: 14
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01668423

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Hierarchy below the Halting Problem fo

A Hierarchy below the Halting Problem for Additive Machines

✍ Christine Gaßner 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 297 KB

Construction theory, self-replication, a

Construction theory, self-replication, and the halting problem

✍ Hiroki Sayama 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that self‐replication of von Neumann's universal construc

Modeling unstructured decision problems

Modeling unstructured decision problems — the theory of analytical hierarchies

✍ Thomas L. Saaty 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Strong Computability and Variants of the

Strong Computability and Variants of the Uniform Halting Problem

✍ Gabor T. Herman 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 1005 KB

Dark energy and the hierarchy problem

✍ Pisin Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Graph Ramsey Theory and the Polynomial H

Graph Ramsey Theory and the Polynomial Hierarchy

✍ Marcus Schaefer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 402 KB

In the Ramsey theory of graphs F Ä (G, H) means that for every way of coloring the edges of F red and blue F will contain either a red G or a blue H. Arrowing, the problem of deciding whether F Ä (G, H), lies in 6 p 2 =coNP NP and it was shown to be coNP-hard by Burr [Bur90]. We prove that Arrowing