| Publication | Date of Publication | Type |
|---|
| A busy-beaver-like function in complexity theory | 2024-10-24 | Paper |
| From here to eternity | 2024-10-24 | Paper |
| On Hilbert's sixth problem | 2021-09-14 | Paper |
| Learning the Undecidable from Networked Systems | 2021-06-15 | Paper |
| Selva Selvaggia | 2021-06-15 | Paper |
| Can a free market be complete? | 2020-06-29 | Paper |
| A beautiful theorem | 2020-02-04 | Paper |
| Learning the undecidable from networked systems | 2019-04-08 | Paper |
| Metamathematical limits to computation | 2016-11-09 | Paper |
| Einstein meets Gödel | 2014-01-24 | Paper |
| Why is the \(\mathrm{P}=?\mathrm{NP}\) question so difficult | 2013-04-24 | Paper |
| Blueprint for a hypercomputer | 2013-02-26 | Paper |
| Gödel's way. Exploits into an undecidable world | 2011-11-25 | Paper |
| Are the foundations of computer science logic-dependent? | 2011-05-31 | Paper |
| How to build a hypercomputer | 2009-11-13 | Paper |
| Janus-faced physics: on Hilbert's 6th problem | 2008-03-20 | Paper |
| Fast-Growing Functions and the P vs. NP Question | 2008-01-18 | Paper |
| On the metamathematics of the P vs. NP question | 2007-09-19 | Paper |
| Informal versus formal mathematics | 2007-06-14 | Paper |
| Some thoughts on hypercomputation | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4822150 | 2004-10-25 | Paper |
| Consequences of an exotic definition for \(\text{P}=\text{NP}\). | 2003-11-25 | Paper |
| Is there a simple, pedestrian arithmetic sentence which is independent of ZFC? | 2001-09-13 | Paper |
| Some new incompleteness theorems and their import to the foundations of mathematics | 2001-09-04 | Paper |
| Leopoldo Nachbin: Some personal recollections | 2001-09-04 | Paper |
| A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines | 2001-06-12 | Paper |
| On a total function which overtakes all total recursive functions | 2001-06-12 | Paper |
| On the consistency of $P=NP$ with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment | 2000-06-10 | Paper |
| The Atiyah - Singer index theorem and the gauge field copy problem | 2000-02-07 | Paper |
| The incompleteness of theories of games | 1999-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395540 | 1998-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883232 | 1996-09-18 | Paper |
| Gödel incompleteness, explicit expressions for complete arithmetic degrees and applications | 1996-07-01 | Paper |
| Undecidable Hopf bifurcation with undecidable fixed point | 1996-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4851407 | 1995-10-10 | Paper |
| Undecidability, incompleteness and Arnol'd problems | 1995-09-11 | Paper |
| On Jaśkowski's discussive logics | 1995-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4300141 | 1994-11-24 | Paper |
| Dynamical system where proving chaos is equivalent to proving Fermat's conjecture | 1994-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4282601 | 1994-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4277694 | 1994-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038402 | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4025015 | 1993-02-22 | Paper |
| Undecidability and incompleteness in classical mechanics | 1992-06-25 | Paper |
| A Suppes predicate for general relativity and set-theoretically generic spacetimes | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781755 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781087 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217230 | 1984-01-01 | Paper |
| The geometry of gauge field copies | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670135 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3871595 | 1979-01-01 | Paper |
| Mesonic test fields and spacetime cohomology | 1978-01-01 | Paper |
