ComputingComputer ScienceArtificial IntelligenceTheory Of ComputationComplexity TheoryComputational ComplexityComputational ModelsEvolutionary ComputationTuring MachinesExpressivenessModel Of ComputationTuring Machine ComputabilityTuring Machine Model
In this paper we describe and analyze models of problem solving and computation going beyond Turing Machines. Three principles of extending the Turing Machine's expressiveness are identified, namely, by interaction, evolution and infinity. Several models utilizing the above principles are presented. Other
15
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Theory of Self-Reproducing Automata
Jacob T. Schwartz, John von Neumann, Arthur W. Burks · Mathematics of Computation · 1967 · 5.5K citations