Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Structure and Computation

View through CrossRef
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure. In this paper, I challenge this truism by showing that isomorphic systems can differ with regard to important computational features of numbers. This confronts arithmetical structuralists with a dilemma. On the one hand, many computability‐theoretic properties are only satisfied by particular number systems, and are hence disqualified as irrelevant by structuralist accounts. On the other hand, these properties turn out to be highly relevant to arithmetical practice. Hence, as I argue, arithmetical structuralism is not a tenable view about arithmetic.
Title: Structure and Computation
Description:
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic.
This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
In this paper, I challenge this truism by showing that isomorphic systems can differ with regard to important computational features of numbers.
This confronts arithmetical structuralists with a dilemma.
On the one hand, many computability‐theoretic properties are only satisfied by particular number systems, and are hence disqualified as irrelevant by structuralist accounts.
On the other hand, these properties turn out to be highly relevant to arithmetical practice.
Hence, as I argue, arithmetical structuralism is not a tenable view about arithmetic.

Related Results

DNA Computation: Theory, Practice, and Prospects
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also i...
Non-deterministic structures of computation
Non-deterministic structures of computation
Divergence and non-determinism play a fundamental role in the theory of computation, and their combined effect on computational equality deserves further study. By looking at the i...
Power system security assessment through analog computation
Power system security assessment through analog computation
This dissertation proposes a methodology for power system security assessment through analog computation. By exploiting the strengths of analog computation a more robust security a...
Performance Enhancement of Multi-level Inverters with Different Computation Techniques
Performance Enhancement of Multi-level Inverters with Different Computation Techniques
Multi-Level Inverters (MLIs) have garnered significant attention in recent years due to their ability to address the limitations of traditional two-level inverters, such as high vo...
Verifiable FHE via Lattice-based SNARKs
Verifiable FHE via Lattice-based SNARKs
Fully Homomorphic Encryption (FHE) is a prevalent cryptographic primitive that allows for computation on encrypted data. In various cryptographic protocols, this enables outsourcin...
Perbandingan Struktur Modal Perusahaan Property dan Konstruksi Bangunan Periode 2015-2019
Perbandingan Struktur Modal Perusahaan Property dan Konstruksi Bangunan Periode 2015-2019
ABSTRACTCapital structure is a comparison of own capital with foreign capital owned by each company. Capital alone can be divided into retained earnings and company ownership. Mean...
Privacy-Preserving Computation:A Comprehensive Survey of Methods and Applications
Privacy-Preserving Computation:A Comprehensive Survey of Methods and Applications
This paper presents a comprehensive review of privacy-preserving computation, including its various methods, such as Trusted Environment Execution (TEE) computation, Secure Multi-P...
Local Computation Mechanism Design
Local Computation Mechanism Design
We introduce the notion of local computation mechanism design —designing game-theoretic mechanisms that run in polylogarithmic time and space. Local computa...

Back to Top