Squeezing Feasibility

Conference paper

DOI: 10.1007/978-3-319-40189-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9709)
Cite this paper as:
Dean W. (2016) Squeezing Feasibility. In: Beckmann A., Bienvenu L., Jonoska N. (eds) Pursuit of the Universal. CiE 2016. Lecture Notes in Computer Science, vol 9709. Springer, Cham

Abstract

This note explores an often overlooked question about the characterization of the notion model of computation which was originally identified by Cobham [5]. A simple formulation is as follows: what primitive operations are allowable in the definition of a model such that its time and space complexity measures provide accurate gauges of practical computational difficulty? After exploring the significance of this question in the context of subsequent work on machine models and simulations, an adaptation of Kreisel’s squeezing argument [17] for Church’s Thesis involving Gandy machines [11] is sketched which potentially bears on this question.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of PhilosophyUniversity of WarwickCoventryUK

Personalised recommendations