Paroecopolis

Paroecopolis or Paroikopolis (Ancient Greek: Παροικόπολις), Parthicopolis or Parthikopolis (Παρθικόπολις), or Parthenopolis (Παρθενόπολις), was an ancient city in Sintice region in ancient Thrace and later Macedon. During Byzantine times it was a bishopric seat. Its site is located near modern Sandanski, Bulgaria.[1][2]

History

This see is not mentioned in any of the Greek Notitiae episcopatuum, so it probably was not an important city.

Parœcopolis is presented by Sophrone Petrides in a 1911 article in the Catholic Encyclopedia as a bishopric of uncertain name (Paroecopolis, Parthicopolis or Parthenopolis) and situated either in Macedonia or in Thrace.[3]

The town is mentioned by Ptolemy[4] as being in Sintice, a part of Macedonia, and by Phlegon of Tralles.[5]

Hierocles[6] and Constantine Porphyrogenitus[7] call it Parthicopolis, but the second locates it in Thrace.

Stephanus Byzantius calls it Parthenopolis and relates according to Theagenes the legend of its foundation by Grastus, son of Mygdon, said to have named the city in honour of his two daughters. Pliny[8] has the same name, but also places it in Thrace.

Ecclesiastical history

Its bishop, Jonas or John, assisted at the Council of Sardica (342 or 343); at the Council of Chalcedon (451) there was present John "Parthicopolis primæ Macedoniae".[9] That suggests it was in Macedonia Prima and hence a suffragan of its capital Thessalonica's Metropolitan Archbishopric.

Notes
  1. Richard Talbert, ed. (2000). Barrington Atlas of the Greek and Roman World. Princeton University Press. p. 50, and directory notes accompanying.
  2. Lund University. Digital Atlas of the Roman Empire.
  3. Pétridès, Sophron (1913). "Parœcopolis". Catholic Encyclopedia. Volume 11.
  4. III, 13, 30.
  5. "Fragm. histor. gr." ed. Didot, III, 609.
  6. Synecdemus, 639, 8.
  7. De thematibus, 2.
  8. IV, xi.
  9. Le Quien, Oriens christianus, II, 75.

gollark: Well, sure, but the basic idea is just that it can execute up to 2^(memory size) operations in a negligible amount of time.
gollark: Oh, maybe if it goes into one state twice it stops, easy™.
gollark: Yes.
gollark: Oh, and elliptic curve crypto keys I guess, those are small.
gollark: You could only really do stuff like bruteforce hashes.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.