Alexander Dewdney
| Use attributes for filter ! | |
| Gender | Male |
|---|---|
| Age | 83 |
| Date of birth | August 5,1941 |
| Zodiac sign | Leo |
| Born | London |
| Canada | |
| Spouse | Patricia Helen Dewdney |
| Parents | Selwyn Dewdney |
| Children | Jonathan Woodsworth Dewdney |
| Job | Professor |
| Author | |
| Film director | |
| Mathematician | |
| Computer scientist | |
| Filmmaker | |
| Science writer | |
| Date of Reg. | |
| Date of Upd. | |
| ID | 625040 |
The New Turing Omnibus
The Planiverse
Armchair Universe: An Exploration of Computer Worlds
200% of nothing
Yes, We Have No Neutrons
The Magic Machine: A Handbook of Computer Sorcery
A mathematical mystery tour
The Tinkertoy computer and other machinations
Hungry Hollow
Beyond Reason
Introductory computer science
Stochastic Communities: A Mathematical Theory of Biodiversity
Fast Turing Reductions Between Problems in NP : Chapter 7, Variations on Cooks Theorem
Fast Turing Reductions Between Problems in NP : Chapter 4 : Reductions Between NP-complete Problems
Generic Reduction Computers
Centroid Companion Trees : a Flexible Data Structure for Fast Searching
Fast Solvable Reductions Between Problems in NP : Chapter 2 : Representations and Models
Fast Turing Reductions Between Problems in NP : Chapter 8 : Transforming Algorithms
The NP- completeness of the Crossing Number Problem and Implications for VLSI Layout
Fast Turing Reductions Between Problems in NP : Chapter 3 : Problem List
Fast Solvable Reductions Between Problems in NP : Chapter 1 : Introduction
Fast Turing Reductions Between Problems in NP : Chapter 6 : Linear Classes and Related Theory
Introduction to Computer Science
I-Spy Dinosaurs and Prehistoric Animals
A Study of BLPB Algorithms for NP-hard Problems
Solutions Manual Turing Omnibus
Fast Turing Reductions Between Problems in NP : Chapter 9 : TRANSAT
TRANSAT and NPL : Summary of Design and Implementation in 1984
The Planiverse
Armchair Universe: An Exploration of Computer Worlds
200% of nothing
Yes, We Have No Neutrons
The Magic Machine: A Handbook of Computer Sorcery
A mathematical mystery tour
The Tinkertoy computer and other machinations
Hungry Hollow
Beyond Reason
Introductory computer science
Stochastic Communities: A Mathematical Theory of Biodiversity
Fast Turing Reductions Between Problems in NP : Chapter 7, Variations on Cooks Theorem
Fast Turing Reductions Between Problems in NP : Chapter 4 : Reductions Between NP-complete Problems
Generic Reduction Computers
Centroid Companion Trees : a Flexible Data Structure for Fast Searching
Fast Solvable Reductions Between Problems in NP : Chapter 2 : Representations and Models
Fast Turing Reductions Between Problems in NP : Chapter 8 : Transforming Algorithms
The NP- completeness of the Crossing Number Problem and Implications for VLSI Layout
Fast Turing Reductions Between Problems in NP : Chapter 3 : Problem List
Fast Solvable Reductions Between Problems in NP : Chapter 1 : Introduction
Fast Turing Reductions Between Problems in NP : Chapter 6 : Linear Classes and Related Theory
Introduction to Computer Science
I-Spy Dinosaurs and Prehistoric Animals
A Study of BLPB Algorithms for NP-hard Problems
Solutions Manual Turing Omnibus
Fast Turing Reductions Between Problems in NP : Chapter 9 : TRANSAT
TRANSAT and NPL : Summary of Design and Implementation in 1984
Alexander Dewdney Life story
Alexander Keewatin Dewdney is a Canadian mathematician, computer scientist, author, filmmaker, and conspiracy theorist. Dewdney is the son of Canadian artist and author Selwyn Dewdney, and brother of poet Christopher Dewdney.
