Return to search

A Complexity of Real Functions based on Analog Computing

This thesis is focused on analyzing a particular notion of complexity of real valued functions through the lens of analog computers. This report features design changes to Pour-El’s notion of an analog computer that reflect this question of complexity in a concrete way. Additionally, these changes to the analog computer allow an extension of Pour-El’s work in which the complexity of a function can be identified with the order of a differentiably algebraic equation that the function satisfies.

Identiferoai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1234
Date01 January 2019
CreatorsDhillon, Adam
PublisherScholarship @ Claremont
Source SetsClaremont Colleges
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceHMC Senior Theses
Rights© 2019 Adam L Dhillon, default

Page generated in 0.0019 seconds