Infeasibility of solving finite mathematical problems

We prove that the decision problem for finite mathematical statements, though recursive, is infeasible in seemingly any realistic model of computation. In particular, we construct of a set of finite mathematical statements which can only be feasibly solved by programs long enough to explicitly encod...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Brown, Adam
Format:	Dissertation
Sprache:	Englisch
Veröffentlicht:	ProQuest Dissertations & Theses 01.01.2010
Schlagworte:	Computer science Mathematics
ISBN:	9780494660690, 0494660694
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!