Stephen Zápolya

Stephen Zápolya (Hungarian: Szapolyai István; died on 23 December 1499), was Palatine of the Kingdom of Hungary between 1492 and 1499.[1]

He married Polish princess Hedwig of Cieszyn on 11 August 1483 (his second marriage), by whom he had four children:

He was buried in the Zápolya family vault on the Szepes chapter house.

Notes

  1. Markó 2006, p. 252.

Sources

  • Engel, Pál (2001). The Realm of St Stephen: A History of Medieval Hungary, 895–1526. I.B. Tauris Publishers. ISBN 1-86064-061-3.CS1 maint: ref=harv (link)
  • Markó, László (2006). A magyar állam főméltóságai Szent Istvántól napjainkig: Életrajzi Lexikon [Great Officers of State in Hungary from King Saint Stephen to Our Days: A Biographical Encyclopedia] (in Hungarian). Helikon Kiadó. ISBN 963-547-085-1.CS1 maint: ref=harv (link)
  • Kubinyi, András (2008). Matthias Rex. Balassi Kiadó. ISBN 978-963-506-767-1.CS1 maint: ref=harv (link)
Stephen
House of Zápolya
Born: ?  Died: 23 December 1499
Political offices
Vacant
Title last held by
Emeric Zápolya
Palatine of Hungary
1492–1499
Succeeded by
Peter Geréb
gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
gollark: I don't know exactly what its instruction set is like. But if it has finite-sized addresses, it can probably access finite amounts of memory, and thus is not Turing-complete.
gollark: *Languages* can be, since they often don't actually specify memory limits, implementations do.
gollark: It's not Turing-complete if it has limited memory.
gollark: Not *really*. In languages with an abstract model that doesn't specify limited memory sizes, yes, but PotatOS Assembly Language™'s addresses are 16 bits, so you can't address any more RAM than that.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.