van Leeuwen, Jan · SpringerLink

Access this article

Log in via an institution

Subscribe and save

Springer+

from $39.99 /Month

  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Burgin, M. (1983). Inductive Turing machines. Notices of the Russian Academy of Sciences, 270(6), 1289–1293.

    MathSciNet  Google Scholar 

  • Colburn, T., & Shute, G. (2007). Abstraction in computer science. Minds and Machines, 17, 169–184.

    Article  Google Scholar 

  • Cravotta, R. (2004). Driving out complexity with abstraction tools. In Electrical Design News (EDN), June 24, 2004. URL: http://www.edn.com/design/systems-design/4333448/Driving-out-complexity-with-abstraction-tools.

  • Dijkstra, E. W. (1972). The humble programmer. Communications of the ACM, 15(10), 859–866.

    Article  Google Scholar 

  • Dijkstra, E. W. (1972). Notes on structured programming. In O.-J. Dahl, E. W. Dijkstra & C. A. R. Hoare (Eds.), Structured programming. APIC studies in data processing (Vol. 8, pp. 1–82). London: Academic Press.

  • Floridi, L. (2011). The philosophy of information. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Gurevich, Y. (2012). Foundational analysis of computation. In S. B. Cooper, A. Dawar, B. Löwe (Eds.), How the world computes? Proceedings CiE 2012 (Vol. 7318, pp. 264–275). Lecture Notes in Computer Science.

  • Hogarth, M. (2004). Deciding arithmetic using SAD computers. British Journal for the Philosophy of Science, 55, 681–691.

    Article  MATH  MathSciNet  Google Scholar 

  • Huang, S. S. (2009). Structural abstraction—A mechanism for modular program construction. Ph.D. thesis, College of Computing, Georgia Institute of Technology.

  • Kleene, S. C. (1952). Introduction to metamathematics. Amsterdam: North-Holland.

    MATH  Google Scholar 

  • Kramer, J. (2007). Is abstraction the key to computing? Communications of the ACM, 50(4), 37–42.

    Article  Google Scholar 

  • Lyon, D. (2010). Semantic annotation for Java. Journal of Object Technology, 9(3), 19–29.

    Article  Google Scholar 

  • Marr, D. (1982). Vision—A computational investigation into the human representation and processing of visual information. San Francisco: W. H. Freeman.

  • McClamrock, R. (1991). Marr’s three levels: A re-evaluation. Minds and Machines, 1, 185–196.

    Article  Google Scholar 

  • Naur, P., & Randell, B. (Eds.). (1969). Software engineering. Report on a conference sponsored by the NATO Science Committee (Garmisch, Germany, 7–11 Oct. 1968). Scientific Affairs Division, NATO, Brussels.

  • Sloman, A. (2009). What cognitive scientists need to know about virtual machines. In N. A. Taatgen & H. van Rijn (Eds.), Proceedings of the 31st annual conference of the Cognitive Science Society (CogSci 2009) (pp. 1210–1215). Cognitive Science Society.

  • Syropoulos, A. (2008). Hypercomputation—Computing beyond the Church–Turing barrier. New York: Springer.

    MATH  Google Scholar 

  • Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42(1), 230–265.

    Google Scholar 

  • Turing, A. M. (1939). Systems of logic based on ordinals. Proceedings of the London Mathematical Society, Series 2, 45(1), 161–228.

    Article  Google Scholar 

  • van Leeuwen, J. (2009). Towards a philosophy of the information and computing sciences. NIAS Newsletter, 42, 22–25.

    Google Scholar 

  • van Leeuwen, J., & Wiedermann, J. (2012). Computation as an unbounded process. Theoretical Computer Science, 429, 202–212.

    Article  MATH  MathSciNet  Google Scholar 

  • Wiedermann, J., & van Leeuwen, J. (2013). Rethinking computation. In Proceedings of the 6th AISB Symposium on Computing and Philosophy(pp. 6–10). AISB Convention, Exeter.

Download references

Read the original on link.springer.com ↗