- Effective Mathemematics of the Uncountable
[bibtex key=EMU]
- Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
[bibtex key=CoskeyHamkins2013:ITTMandApplicationsToEquivRelations]
- Infinite time decidable equivalence relation theory
[bibtex key=CoskeyHamkins2011:InfiniteTimeComputableEquivalenceRelations]
- Post's problem for ordinal register machines: an explicit approach
[bibtex key=HamkinsMiller2009:PostsProblemForORMsExplicitApproach]
- Infinite time computable model theory
[bibtex key=HamkinsMillerSeaboldWarner2007:InfiniteTimeComputableModelTheory]
- A survey of infinite time Turing machines
[bibtex key=Hamkins2007:ASurveyOfInfiniteTimeTuringMachines]
- The complexity of quickly decidable ORM-decidable sets
[bibtex key=HamkinsLinetskyMiller2007:ComplexityOfQuicklyDecidableORMSets]
- Post's Problem for Ordinal Register Machines
[bibtex key=HamkinsMiller2007:PostsProblemForORMs]
- ${\rm P}\neq{\rm NP}\cap\textrm{co-}{\rm NP}$ for infinite time Turing machines
[bibtex key=DeolalikarHamkinsSchindler2005:NPcoNP]
- Infinitary computability with infinite time Turing machines
[bibtex key=Hamkins2005:InfinitaryComputabilityWithITTM]
- Supertask computation
[bibtex key=Hamkins2004:SupertaskComputation]
- ${\rm P}^f\neq {\rm NP}^f$ for almost all $f$
[bibtex key=HamkinsWelch2003:PfneqNPf]
- Post's problem for supertasks has both positive and negative solutions
[bibtex key=HamkinsLewis2002:PostProblem]
- Infinite time Turing machines
[bibtex key=Hamkins2002:Turing]
- Infinite time Turing machines with only one tape
[bibtex key=HamkinsSeabold2001:OneTape]
- Infinite time Turing machines
[bibtex key=HamkinsLewis2000:InfiniteTimeTM]
Joel David Hamkins
mathematics and philosophy of the infinite
Pingback: A course in infinitary computability, Fall 2012, CUNY Graduate Center, CSC 85020 | Joel David Hamkins