The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem

2006 ◽  
pp. 195-206 ◽  
Author(s):  
Jerzy Mycka ◽  
Francisco Coelho ◽  
José Félix Costa
Keyword(s):  
Abstract Machine ◽  
Halting Problem

Deleuze as Subject – B2430.D454 – Mapping Deleuze Studies in the Library

2017 ◽  
Vol 11 (3) ◽  
pp. 429-456
Author(s):  
Melissa Adler
Keyword(s):  
Academic Libraries ◽  
The Body ◽  
Theory And Practice ◽  
Library Of Congress ◽  
Abstract Machine ◽  
Discipline Formation ◽  
The World ◽  
Circulation Of Knowledge

Guided by Deleuze's taxonomic theory and practice and his concepts concerning the body, literature, territory and assemblage, this article examines library classification as a technique of discipline and bibliographic control. Locating books written by and about Deleuze reveals processes of discipline formation and the circulation of knowledge, and it troubles the principles upon which the classification is based. A Deleuzian critique presents the Library of Congress Classification as an abstract machine that diagrams knowledge in many academic libraries around the world.

scholarly journals Fine-grain parallelism with minimal hardware support: a compiler-controlled threaded abstract machine

1991 ◽  
Vol 25 (Special Issue) ◽  
pp. 164-175
Author(s):  
David E. Culler ◽  
Anurag Sah ◽  
Klaus E. Schauser ◽  
Thorsten von Eicken ◽  
John Wawrzynek
Keyword(s):  
Hardware Support ◽  
Abstract Machine ◽  
Fine Grain ◽  
Minimal Hardware

A proof of Beigel's cardinality conjecture

1992 ◽  
Vol 57 (2) ◽  
pp. 677-681 ◽  
Author(s):  
Martin Kummer
Keyword(s):  
Complexity Theory ◽  
Structural Complexity ◽  
Halting Problem ◽  
Parallel Queries

In 1986, Beigel [Be87] (see also [Od89, III.5.9]) proved the nonspeedup theorem: if A, B ⊆ ω, and as a function of 2n variables can be computed by an algorithm which makes at most n queries to B, then A is recursive (informally, 2n parallel queries to a nonrecursive oracle A cannot be answered by making n sequential (or “adaptive”) queries to an arbitrary oracle B). Here, 2n cannot be replaced by 2n − 1. In subsequent papers of Beigel, Gasarch, Gill, Hay, and Owings the theory of “bounded query classes” has been further developed (see, for example, [BGGOta], [BGH89], and [Ow89]). The topic has also been studied in the context of structural complexity theory (see, for example, [AG88], [Be90], and [JY90]).If A ⊆ ω and n ≥ 1, let . Beigel [Be87] stated the powerful “cardinality conjecture” (CC): if A, B ⊆ ω, and can be computed by an algorithm which makes at most n queries to B, then A is recursive. Owings [Ow89] verified CC for n = 1, and, for n 1, he proved that A is recursive in the halting problem. We prove that CC is true for all n.

Sign in / Sign up

Export Citation Format

Share Document