Mark Hogarth
Biographic Data
| ID | 3943574 |
|---|---|
| NAME | Mark Hogarth |
| GIVEN NAMES | Mark |
| FAMILY NAME | Hogarth |
| SIGNATURE | HOGARTH M |
| AFFILIATIONS | University of Cambridge |
| VERIFIED | No |
| TOTAL WORKS | 4 |
| TOTAL CITATIONS | 17 |
| AUTHOR COUNT | 4 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 1993 |
| LATEST PUBLICATION YEAR | 2004 |
| H-INDEX | 2 |
Deciding Arithmetic Using SAD Computers
Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hier…
A remark concerning prediction and spacetime singularities
The definability of objective becoming in Minkowski spacetime
Predicting the future in relativistic spacetimes
The definability of objective becoming in Minkowski spacetime
Deciding Arithmetic Using SAD Computers
Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hier…
Predicting the future in relativistic spacetimes
Predicting the future in relativistic spacetimes
The definability of objective becoming in Minkowski spacetime
A remark concerning prediction and spacetime singularities
Deciding Arithmetic Using SAD Computers
Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hier…
Mathematics (4 works) · Computer Science (3 works) · Physics (3 works) · Theoretical physics (3 works) · Arithmetic (2 works) · Cosmology and Gravitation Theories (2 works) · Epistemology (2 works) · Philosophy (2 works) · Pure mathematics (2 works) · Quantum mechanics (2 works)