Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3941529

From MaRDI portal
Publication:3714072
Jump to:navigation, search

zbMATH Open0587.03037MaRDI QIDQ3714072FDOQ3714072


Authors: Peter G. Hinman Edit this on Wikidata


Publication date: 1984



Title of this publication is not available (Why is that?)



Recommendations

  • The countably based functionals
  • Characterizing the continuous functionals
  • scientific article; zbMATH DE number 3884099
  • Approximation of continuous functions by finite automata
  • On a finitary version of mathematical analysis


zbMATH Keywords

continuous functionalsgeneralized recursion theorycountable functionalsfilter spacesfinite approximations to infinite objects


Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)



Cited In (7)

  • Infinitesimal analysis. Part 2.
  • How much partiality is needed for a theory of computability?
  • Almost finiteness and the small boundary property
  • On a finitary version of mathematical analysis
  • Conservatively approximable functions
  • Finite-tight sets
  • Approximations of mappings





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714072)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3714072&oldid=17216123"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 09:31. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki