## Superminds: People Harness Hypercomputation, and MoreThis is the first book-length presentation and defense of a new theory of human and machine cognition, according to which human persons are superminds. Superminds are capable of processing information not only at and below the level of Turing machines (standard computers), but above that level (the "Turing Limit"), as information processing devices that have not yet been (and perhaps can never be) built, but have been mathematically specified; these devices are known as super-Turing machines or hypercomputers. Superminds, as explained herein, also have properties no machine, whether above or below the Turing Limit, can have. The present book is the third and pivotal volume in Bringsjord's supermind quartet; the first two books were What Robots Can and Can't Be (Kluwer) and AI and Literary Creativity (Lawrence Erlbaum). The final chapter of this book offers eight prescriptions for the concrete practice of AI and cognitive science in light of the fact that we are superminds. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

VII | 1 |

VIII | 2 |

IX | 4 |

X | 7 |

XI | 13 |

XII | 21 |

XIII | 24 |

XIV | 25 |

XLI | 133 |

XLII | 134 |

XLIII | 135 |

XLIV | 142 |

XLV | 143 |

XLVI | 152 |

XLVII | 159 |

XLVIII | 171 |

XV | 29 |

XVI | 33 |

XVII | 43 |

XVIII | 49 |

XIX | 51 |

XX | 53 |

XXI | 56 |

XXII | 58 |

XXIII | 60 |

XXIV | 62 |

XXV | 65 |

XXVI | 68 |

XXVII | 71 |

XXVIII | 76 |

XXIX | 77 |

XXX | 80 |

XXXI | 85 |

XXXII | 87 |

XXXIII | 88 |

XXXIV | 91 |

XXXV | 92 |

XXXVI | 100 |

XXXVII | 106 |

XXXIX | 123 |

XL | 126 |

### Other editions - View all

Superminds: People Harness Hypercomputation, and More Selmer Bringsjord,M. Zenzen Limited preview - 2012 |

### Common terms and phrases

affirm agent algorithm Arithmetic Hierarchy artificial behavior brain Bringsjord Bringsjord 1992 Busy Beaver capture Chapter chess Chinese Room Chisholm Church's Thesis claim Cleland cognition computation computationalism computationalist concept connectionism consciousness course Dennett discussion dispositional beliefs example explain fact Ferrucci Figure finite first-order logic follows formal formula function given Godel Godelian halt halting problem human persons hypercomputation infinitary reasoning infinite input instantiated intelligent intuitive Jim Fahey least mathematical reasoning mathematicians Mendelson mental mind modus tollens natural numbers neural nets notion objection oracle P-consciousness Penrose Penrose's personhood phenomena physical Pinker possible predicate premise present problem proof properties proposition question readers recall reversible robots Searle seems sequence simply simulation sort specifically story supermentalism superminds supertasks suppose tape theorem theory things thought-experiment tion true Turing Limit Turing machines Turing Test Turing-computable uncomputable Wallace's Paradox wumpus Zenzen zombanimals zombies