Results 171 to 180 of about 1,341 (220)

Unfit for the future? The depoliticization of human perfectibility, from the Enlightenment to transhumanism

open access: yesEuropean Journal of Social Theory, 2018
An intellectual and cultural movement advocating a radical enhancement of human performance via technoscientific and biomedical advances, transhumanism has grown in notoriety in recent years.
Nicolas le Dévédec
exaly   +2 more sources

Perfection Perfected

Novum Testamentum, 2015
Hebrews evinces the linked exegetical aporiae of, on the one hand, tension between the asserted perfection of the believer and exhortations to further perfection and, on the other, a similar tension between Christ's exalted, preexistent nature and claims about his need for further perfection during his earthly life.
openaire   +2 more sources

Perfect and Deficient Perfect Numbers

The American Mathematical Monthly, 2019
For n a positive integer, let σ(n) denote the sum of the divisors of n. The number n is said to be deficient perfect if σ(n)/n=(2x−1)/x for some x∈N .
Rachfal, Emily, Holdener, Judy
openaire   +2 more sources

The quest for the perfect perfect-maze

2015 Computer Games: AI, Animation, Mobile, Multimedia, Educational and Serious Games (CGAMES), 2015
In this paper, the quest for the perfect perfect-maze is performed over the search space of perfect mazes using an approach of search-based procedural content generation. Perfect maze construction is rather random with little to no control of the final product.
Paul Hyunjin Kim, Roger Crawfis
openaire   +1 more source

Perfect Digraphs

Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres   +1 more
openaire   +3 more sources

Perfect and locally perfect colorings

Journal of Graph Theory, 1995
AbstractWe present a new algorithm for coloring perfect graphs and use it to color the parity orderable graphs, a class which strictly contains parity graphs. Also, we modify this algorithm to obtain an O(m2 + n) locally perfect coloring algorithm for parity graphs. © 1995 John Wiley & Sons, Inc.
openaire   +2 more sources

Home - About - Disclaimer - Privacy