activity
20102020
most citedThe Rosenberg-Strong Pairing Function

6 citations · 6 across the 3 of their papers we have counts for

collaborators

6 papers

math.LO2020

Semantics of Computable Physical Models

Matthew P. Szudzik

This article reformulates the theory of computable physical models, previously introduced by the author, as a branch of applied model theory in first-order logic. It provides a sem…

cs.DM2018

Binary Proportional Pairing Functions

Matthew P. Szudzik

A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or…

cs.DM2017★ 6 cited

The Rosenberg-Strong Pairing Function

Matthew P. Szudzik

This article surveys the known results (and not very well-known results) associated with Cantor's pairing function and the Rosenberg-Strong pairing function, including their invers…

math.LO2012

Is Turing's Thesis the Consequence of a More General Physical Principle?

Matthew P. Szudzik

We discuss historical attempts to formulate a physical hypothesis from which Turing's thesis may be derived, and also discuss some related attempts to establish the computability o…

math.LO2010

On the definability of functionals in Gödel's theory T

Matthew P. Szudzik

Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for…

math.LO2010

The Computable Universe Hypothesis

Matthew P. Szudzik

When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our defini…