(Tóth is pronounced as "taught", the past participle of the verb "teach".)
I am a PhD student of Leeds Logic Group in Mathematical Logic, Computability Theory.
I am interested in Artificial Intelligence, in formalising and generalizing a human mind, in the limits of the human reasoning and the comprehensibility of the truth:
Can humans solve the halting problem?
Is Church-Turing thesis true?
Can every mathematical proof of the consistency of ZFC (if there is one) as a result of human activity be translated to use the axioms of ZFC? (c.f. Key Assumption of Timothy Chow)
What is the algorithm that could solve efficiently every mathematical problem that any possible smartest human mathematician could ever solve?
Is there an algorithm that could answer metaphysical questions in a human language wisely?
Before formalising a mathematical mind, I should be a better mathematician myself!
I am currently interested in Higher Computability Theory, Higher Descriptive Set Theory and their connections with Topology and Geometry.
I am working on the automorphism groups of the α-enumeration degrees and the hyperenumeration degrees.
Publications and Preprints
- Dávid Tóth, Imparo is complete by inverse subsumption.
- Sujatha R. Upadhyaya and Dávid Tóth, An Experiment with Asymmetric Algorithm: CPU Vs. GPU, DASFAA '12, 17th International Conference on Database
Systems for Advanced Applications (Semantic & Decision Support Systems), 15-18 April 2012,
Busan, South Korea, Volume 7239, 2012, pp 272-281, Lecture Notes in Computer Science
- Dávid Tóth, A Survey of Higher Computability Theory